论文信息 - Decidability of Right One-Way Jumping Finite Automata

Decidability of Right One-Way Jumping Finite Automata

We continue our investigation [S. Beier, M. Holzer: Properties of right one-way jumping finite automata. In Proc. 20th DCFS, LNCS, 2018] on (right) one-way jumping finite automata (ROWJFAs), a vari...

Markus Holzer | Simon Beier

[1] Rohit Parikh,et al. On Context-Free Languages , 1966, JACM.

[2] Eryk Kopczynski,et al. Complexity of Problems for Commutative Grammars , 2010, Log. Methods Comput. Sci..

[3] Alexander Meduna,et al. Chapter 17 Jumping Finite Automata , 2014 .

[4] Akihiro Yamamura,et al. One-Way Jumping Finite Automata , 2016, Int. J. Found. Comput. Sci..

[5] S. Ginsburg,et al. Semigroups, Presburger formulas, and languages. , 1966 .

[6] Henning Fernau,et al. Characterization and complexity results on jumping finite automata , 2017, Theor. Comput. Sci..

[7] Róbert Szelepcsényi,et al. The method of forced enumeration for nondeterministic automata , 1988, Acta Informatica.

[8] Alexander Meduna,et al. Jumping Finite Automata , 2012, Int. J. Found. Comput. Sci..

[9] Vojtech Vorel. On Basic Properties of Jumping Finite Automata , 2018, Int. J. Found. Comput. Sci..

[10] Henning Fernau,et al. Jumping Finite Automata: Characterizations and Complexity , 2015, CIAA.

[11] Seymour Ginsburg,et al. BOUNDED REGULAR SETS , 1966 .

[12] Martin Kutrib,et al. Operational State Complexity and Decidability of Jumping Finite Automata , 2017, DLT.

[13] Neil Immerman. Nondeterministic Space is Closed Under Complementation , 1988, SIAM J. Comput..

[14] Markus Holzer,et al. Properties of Right One-Way Jumping Finite Automata , 2018, DCFS.