Jean-Camille Birget (1992):
Intersection and Union of Regular Languages and State Complexity.
Inf. Process. Lett. 43(4),
pp. 185–190,
doi:10.1016/0020-0190(92)90198-5.
Viliam Geffert, Carlo Mereghetti & Giovanni Pighizzini (2007):
Complementing two-way finite automata.
Inf. Comput. 205(8),
pp. 1173–1187,
doi:10.1016/j.ic.2007.01.008.
Thomas N. Hibbard (1967):
A Generalization of Context-Free Determinism.
Inf. Control. 11(1/2),
pp. 196–238,
doi:10.1016/S0019-9958(67)90513-X.
John E. Hopcroft & Jeffrey D. Ullman (1979):
Introduction to Automata Theory, Languages and Computation.
Addison-Wesley.
Christos A. Kapoutsis (2005):
Removing bidirectionality from nondeterministic finite automata.
In: MFCS 2005,
Lecture Notes in Computer Science 3618.
Springer,
pp. 544–555,
doi:10.1007/11549345_47.
Giovanni Pighizzini (2013):
Two-Way Finite Automata: Old and Recent Results.
Fundam. Inform. 126(2-3),
pp. 225–246,
doi:10.3233/FI-2013-879.
Giovanni Pighizzini (2019):
Limited Automata: Properties, Complexity and Variants.
In: DCFS 2019,
Lecture Notes in Computer Science 11612.
Springer,
pp. 57–73,
doi:10.1007/978-3-030-23247-4_4.
Giovanni Pighizzini & Andrea Pisoni (2014):
Limited Automata and Regular Languages.
Int. J. Found. Comput. Sci. 25(7),
pp. 897–916,
doi:10.1142/S0129054114400140.
Giovanni Pighizzini & Andrea Pisoni (2015):
Limited Automata and Context-Free Languages.
Fundam. Inform. 136(1-2),
pp. 157–176,
doi:10.3233/FI-2015-1148.
Giovanni Pighizzini & Luca Prigioniero (2019):
Limited automata and unary languages.
Inf. Comput. 266,
pp. 60–74,
doi:10.1016/j.ic.2019.01.002.
Giovanni Pighizzini & Luca Prigioniero (2023):
Forgetting 1-Limited Automata.
In: NCMA 2023,
Electronic Proceedings in Theoretical Computer Science.
To appear.
Available at https://doi.org/10.48550/arXiv.2307.16700.
Giovanni Pighizzini & Luca Prigioniero (2023):
Two-way Machines and de Bruijn Words.
In: CIAA 2023,
Lecture Notes in Computer Science 14151,
pp. 254–265,
doi:10.1007/978-3-031-40247-0_19.
Giovanni Pighizzini, Luca Prigioniero & Simon Šádovský (2022):
1-Limited Automata: Witness Languages and Techniques.
J. Autom. Lang. Comb. 27(1-3),
pp. 229–244,
doi:10.25596/jalc-2022-229.
Michael O. Rabin & Dana S. Scott (1959):
Finite Automata and Their Decision Problems.
IBM J. Res. Dev. 3(2),
pp. 114–125,
doi:10.1147/rd.32.0114.
William J. Sakoda & Michael Sipser (1978):
Nondeterminism and the Size of Two Way Finite Automata.
In: STOC 1978.
ACM,
pp. 275–286,
doi:10.1145/800133.804357.
John C. Shepherdson (1959):
The Reduction of Two-Way Automata to One-Way Automata.
IBM J. Res. Dev. 3(2),
pp. 198–200,
doi:10.1147/rd.32.0198.
Michael Sipser (1980):
Halting Space-Bounded Computations.
Theor. Comput. Sci. 10,
pp. 335–338,
doi:10.1016/0304-3975(80)90053-5.
Michael Sipser (1980):
Lower Bounds on the Size of Sweeping Automata.
J. Comput. Syst. Sci. 21(2),
pp. 195–202,
doi:10.1016/0022-0000(80)90034-3.
Klaus W. Wagner & Gerd Wechsung (1986):
Computational complexity.
D. Reidel Publishing Company, Dordrecht.
eptcs@eptcs.org