论文信息 - Deterministic One-Way Simulation of Two-Way Deterministic Finite Automata over Small Alphabets - 字舞流文

Deterministic One-Way Simulation of Two-Way Deterministic Finite Automata over Small Alphabets

Alexander Okhotin | Viliam Geffert

[1] Alexander Okhotin,et al. On the Transformation of Two-Way Deterministic Finite Automata to Unambiguous Finite Automata , 2021, LATA.

[2] Dana S. Scott,et al. Finite Automata and Their Decision Problems , 1959, IBM J. Res. Dev..

[3] Michael Sipser,et al. Lower bounds on the size of sweeping automata , 1979, J. Comput. Syst. Sci..

[4] Alexander Okhotin,et al. Reversibility of computations in graph-walking automata , 2020, Inf. Comput..

[5] Alexander Okhotin,et al. Transforming Two-Way Alternating Finite Automata to One-Way Nondeterministic Automata , 2014, MFCS.

[6] Christos A. Kapoutsis. Removing Bidirectionality from Nondeterministic Finite Automata , 2005, MFCS.

[7] John C. Shepherdson,et al. The Reduction of Two-Way Automata to One-Way Automata , 1959, IBM J. Res. Dev..

[8] Alexander Okhotin,et al. Describing Periodicity in Two-Way Deterministic Finite Automata Using Transformation Semigroups , 2011, Developments in Language Theory.

[9] Moshe Y. Vardi. A Note on the Reduction of Two-Way Automata to One-Way Automata , 1989, Inf. Process. Lett..