On the Length of Shortest Strings Accepted by Two-way Finite Automata
From MaRDI portal
Publication:5158651
DOI10.3233/FI-2021-2044zbMath1497.68257OpenAlexW4237686249MaRDI QIDQ5158651
Egor Dobronravov, Nikita Dobronravov, Alexander Okhotin
Publication date: 25 October 2021
Published in: Fundamenta Informaticae (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3233/fi-2021-2044
Related Items
Cites Work
- Unnamed Item
- Finite automata and unary languages
- Rational indexes of generators of the cone of context-free languages
- Converting two-way nondeterministic unary automata into simpler automata.
- Shortest Paths in One-Counter Systems
- Reversibility of Computations in Graph-Walking Automata
- Describing Periodicity in Two-Way Deterministic Finite Automata Using Transformation Semigroups
- Decidability and Shortest Strings in Formal Languages
- Mathematical Foundations of Computer Science 2005