J.-M. Autebert, J. Berstel & L. Boasson (1997):
Context-free languages and pushdown automata.
In: G. Rozenberg & A. Salomaa: Handbook of Formal Languages 1.
Springer,
Berlin, Heidelberg,
pp. 111–174,
doi:10.1007/978-3-642-59136-5_3.
G. Buntrock & F. Otto (1998):
Growing context-sensitive languages and Church-Rosser languages.
Informormation and Computation 141,
pp. 1–36,
doi:10.1006/inco.1997.2681.
T.H. Cormen, C.E. Leiserson, R.L. Rivest & C. Stein (2022):
Introduction to Algorithms,
4th edition.
MIT Press.
H. Fernau, M. Paramasivan & M.L. Schmid (2012):
Jumping finite automata: Characterizations and complexity.
In: F. Drewes: CIAA 2012, Proc.,
Lecture Notes in Computer Science 9223.
Springer,
Heidelberg,
pp. 89–101,
doi:10.1007/978-3-319-22360-5_8.
P. Jančar, F. Mráz, M. Plátek & J. Vogel (1995):
Restarting automata.
In: H. Reichel: FCT'95, Proc.,
Lecture Notes in Computer Science 965.
Springer,
Berlin,
pp. 283–292,
doi:10.1007/3-540-60249-6_60.
R. Loukanova (2007):
Linear context free languages.
In: C.B. Jones, Z. Liu & J. Woodcock: ICTAC 2007, Proc.,
Lecture Notes in Computer Science 4711.
Springer,
Heidelberg,
pp. 351–365,
doi:10.1007/978-3-540-75292-9_24.
A. Meduna & P. Zemek (2012):
Jumping finite automata.
International Journal of Foundations of Computer Science 23,
pp. 1555–1578,
doi:10.1142/S0129054112500244.
F. Mráz (2001):
Lookahead hierarchies of restarting automata.
Journal of Automata, Languages and Combinatorics 6,
pp. 493–506,
doi:10.25596/jalc-2001-493.
B. Nagy (2008):
On 5'3' sensing Watson-Crick automata.
In: M. Garzon & H. Yan: DNA Computing, 13th Intern. Meeting, Revised Selected Papers,
Lecture Notes in Computer Science 4848.
Springer,
Heidelberg,
pp. 256–262,
doi:10.1007/978-3-540-77962-9_27.
B. Nagy & L. Kovács (2014):
Finite Automata with Translucent Letters Applied in Natural and Formal Language Theory.
In: N.T. Nguyen, R. Kowalczyk, A. Fred & F. Joaquim: Transactions on Computational Collective Intelligence XVII,
Lecture Notes in Computer Science 8790.
Springer,
Heidelberg,
pp. 107–127,
doi:10.1007/978-3-662-44994-3_6.
B. Nagy & F. Otto (2010):
CD-systems of stateless deterministic R(1)-automata accept all rational trace languages.
In: A.H. Dediu, H. Fernau & C. Martin-Vide: LATA 2010, Proc.,
Lecture Notes in Computer Science 6031.
Springer,
Berlin,
pp. 463–474,
doi:10.1007/978-3-642-13089-2_39.
B. Nagy & F. Otto (2011):
Finite-state acceptors with translucent letters.
In: G. Bel-Enguix, V. Dahl & A.O. De La Puente: BILC 2011: AI Methods for Interdisciplinary Research in Language and Biology, Proc..
SciTePress,
Portugal,
pp. 3–13.
B. Nagy & F. Otto (2011):
Globally deterministic CD-systems of stateless R(1)-automata.
In: A.H. Dediu, S. Inenaga & C. Martín-Vide: Language and Automata Theory and Applications, LATA 2011, Proc.,
Lecture Notes in Computer Science 6638.
Springer,
Berlin,
pp. 390–401,
doi:10.1007/978-3-642-21254-3_31.
B. Nagy & F. Otto (2012):
On CD-systems of stateless deterministic R-automata with window size one.
Journal of Computer and System Sciences 78,
pp. 780–806,
doi:10.1016/j.jcss.2011.12.009.
B. Nagy & F. Otto (2013):
Globally deterministic CD-systems of stateless R-automata with window size 1.
International Journal of Computer Mathematics 90,
pp. 1254–1277,
doi:10.1080/00207160.2012.688820.
F. Otto (2006):
Restarting automata.
In: Z. Ésik, C. Martín-Vide & V. Mitrana: Recent Advances in Formal Languages and Applications,
Studies in Computational Intelligence 25.
Springer,
Heidelberg,
pp. 269–303.
eptcs@eptcs.org