On the Transformation of Two-Way Deterministic Finite Automata to Unambiguous Finite Automata

[1]  Carlo Mereghetti,et al.  Optimal Simulations Between Unary Automata , 1998, STACS.

[2]  Carlo Mereghetti,et al.  Converting two-way nondeterministic unary automata into simpler automata , 2003, Theor. Comput. Sci..

[3]  Alexander Okhotin,et al.  One-way simulation of two-way finite automata over small alphabets , 2013, NCMA.

[4]  Jozef Jirásek,et al.  Operations on Unambiguous Finite Automata , 2018, Int. J. Found. Comput. Sci..

[5]  Christos A. Kapoutsis.  Two-Way Automata Versus Logarithmic Space , 2011, Theory of Computing Systems.

[6]  Oscar H. Ibarra,et al.  Relating the Type of Ambiguity of Finite Automata to the Succinctness of Their Representation , 1989, SIAM J. Comput..

[7]  Alexander Okhotin.  Unambiguous finite automata over a unary alphabet , 2012, Inf. Comput..

[8]  E. M. Schmidt.  Succinctness of Descriptions of Context-Free, Regular and Finite Languages , 1977 .

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

[10]  Mikhail Raskin.  A superpolynomial lower bound for the size of non-deterministic complement of an unambiguous automaton , 2018, ICALP.

[11]  FRANK R. MOORE,et al.  On the Bounds for State-Set Size in the Proofs of Equivalence Between Deterministic, Nondeterministic, and Two-Way Finite Automata , 1971, IEEE Transactions on Computers.

[12]  Jean-Camille Birget.  State-complexity of finite-state devices, state compressibility and incompressibility , 2005, Mathematical systems theory.

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

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

[15]  William J. Sakoda,et al.  Nondeterminism and the size of two way finite automata , 1978, STOC.

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

[17]  Carlo Mereghetti,et al.  Complementing two-way finite automata , 2007, Inf. Comput..

[18]  Hing Leung.  Descriptional complexity of nfa of different ambiguity , 2005, Int. J. Found. Comput. Sci..