Reversibility of Computations in Graph-Walking Automata

DOI10.1007/978-3-642-40313-2_53zbMath1398.68317OpenAlexW191399025MaRDI QIDQ2849946

Michal Kunc, Alexander Okhotin

Publication date: 20 September 2013

Published in: Mathematical Foundations of Computer Science 2013 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-40313-2_53

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (3)

On the Length of Shortest Strings Accepted by Two-way Finite Automata ⋮ On the state complexity of operations on two-way finite automata ⋮ Complement for two-way alternating automata

This page was built for publication: Reversibility of Computations in Graph-Walking Automata