On the State Complexity of Two-Way Reversible Finite Automata
- 5 August 2026
- book chapter
- Published by Springer Nature
- p. 138-150
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- Sweeping permutation automataActa Informatica, 2026
- A Hierarchy of Reversible Finite Automata2025
- Reversibility of computations in graph-walking automataInformation and Computation, 2020
- Complement for two-way alternating automataActa Informatica, 2020
- Two-Way Automata Versus Logarithmic SpaceTheory of Computing Systems, 2013
- Describing Periodicity in Two-Way Deterministic Finite Automata Using Transformation Semigroups2011
- Complementing two-way finite automataInformation and Computation, 2007
- Removing Bidirectionality from Nondeterministic Finite Automata2005
- A note on the reduction of two-way automata to one-way automataInformation Processing Letters, 1989
- Finite automata and unary languagesTheoretical Computer Science, 1986