Two-Way Automata is a computational model in automata theory that, unlike standard finite automata, extends the finite automaton by allowing the input head to move both left and right on the input tape, thereby enabling bidirectional traversal during computation.
101
Publications
5K
Citations
123
Authors
101
Institutions
Publications per year
2017–2026
2
Variants
2-Way Automata
Parents
Publications
101
On the power of quantum finite state automata
A. Kondacs, John Watrous · 2002 · 355 citations
Cellular automata: a discrete view of the world
Choice Reviews Online · 2008 · 317 citations
Nondeterminism and the size of two way finite automata
William J. Sakoda, Michael Sipser · 1978 · 172 citations · Full text
1–5 of 101
Authors
123
- GP
9
h-index
- MY
5
h-index
- ÓH
5
h-index
- CM
5
h-index
- SZ
4
h-index
1–5 of 123
Institutions
101
University of Milan
Milan, Italy
8 h-index
12 publications
485 citations
Université Paris Cité
Paris, France
5 h-index
5 publications
85 citations
Aix-Marseille Université
Marseille, France
4 h-index
4 publications
129 citations
Masaryk University
Brno, Czechia
4 h-index
7 publications
189 citations
Centre National de la Recherche Scientifique
Paris, France
4 h-index
4 publications
73 citations
IBM Research - Almaden
San Jose, United States
4 h-index
5 publications
343 citations
University of Nebraska–Lincoln
Lincoln, United States
4 h-index
4 publications
72 citations
University of Pavol Jozef Šafárik
Košice, Slovakia
3 h-index
3 publications
157 citations
1–8 of 101
Venues
- Theoretical Computer Science
9 publications · 432 citations
9
h-index
- Information and Computation
8 publications · 192 citations
8
h-index
- Information Processing Letters
7 publications · 182 citations
7
h-index
- Theory of Computing Systems
5 publications · 124 citations
5
h-index
- SIAM Journal on Computing
5 publications · 306 citations
5
h-index
1–5