Reversible Ordered Restarting Automata

DOI10.1007/978-3-319-20860-2_4zbMath1464.68181OpenAlexW1119386169MaRDI QIDQ2822491

Kent Kwee, Matthias Wendlandt, Friedrich Otto

Publication date: 30 September 2016

Published in: Reversible Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-20860-2_4

zbMATH Keywords

reversibilitydescriptional complexityrestarting automaton

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Other nonclassical models of computation (68Q09)

Related Items (3)

Deterministic Ordered Restarting Automata that Compute Functions ⋮ On the descriptional complexity of stateless deterministic ordered restarting automata ⋮ Reversibility for stateless ordered RRWW-automata

Cites Work

• Finite automata and unary languages
• Reversible pushdown automata
• Ordered Restarting Automata for Picture Languages
• On the maximal order in $S_n$ and $S*_n$
• Restarting automata
• Weight-Reducing Hennie Machines and Their Descriptional Complexity
• On the Descriptional Complexity of Deterministic Ordered Restarting Automata
• On Some Decision Problems for Stateless Deterministic Ordered Restarting Automata
• Logical Reversibility of Computation

This page was built for publication: Reversible Ordered Restarting Automata