Two-way automata and length-preserving homomorphisms-Reference-Cited by-同舟云学术

Two-way automata and length-preserving homomorphisms

Published:1996-06 Issue:3 Volume:29 Page:191-226
ISSN:0025-5661
Container-title:Mathematical Systems Theory
language:en
Short-container-title:Math. Systems Theory

Author:

Birget J. -C.

Publisher

Springer Science and Business Media LLC

Subject

Computational Theory and Mathematics,General Mathematics,Theoretical Computer Science,Computational Theory and Mathematics,Theoretical Computer Science

Link

http://link.springer.com/content/pdf/10.1007/BF01201276.pdf

Reference44 articles.

1. T. Apostol,Introduction to Analytic Number Theory, Springer-Verlag, New York, 1976.

2. A. Aho, J. Hopcroft, and J. Ullman,The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, MA, 1974.

3. J.-C. Birget, Concatenation of inputs in a two-way automaton,Theoretical Computer Science 63 (1989), 141–156.

4. Lecture Notes in Computer Science, Vol. 386;J.-C. Birget,1989

5. J.-C. Birget, Positional simulation of two-way automata: proof of a conjecture of R. Kannan, and generalizations,Journal of Computer and System Sciences 45 (1992), 154–179 (special issue onSTOC 89).

Cited by 8 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. On the Translation of Automata to Linear Temporal Logic;Lecture Notes in Computer Science;2022

2. Alternation in two-way finite automata;Theoretical Computer Science;2021-05

3. Counting with Probabilistic and Ultrametric Finite Automata;Computing with New Resources;2014

4. Predicate Characterizations in the Polynomial-Size Hierarchy;Language, Life, Limits;2014

5. Analogs of Fagin’s Theorem for Small Nondeterministic Finite Automata;Developments in Language Theory;2012