Reversibility for stateless ordered RRWW-automata

DOI10.1007/s00236-020-00389-0OpenAlexW3183731339MaRDI QIDQ2041689

Friedrich Otto, Matthias Wendlandt

Publication date: 23 July 2021

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00236-020-00389-0

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Descriptive complexity and finite models (68Q19)

Cites Work

• Unnamed Item
• Unnamed Item
• On stateless deterministic restarting automata
• Finite automata and unary languages
• On the descriptional complexity of stateless deterministic ordered restarting automata
• Reversible pushdown automata
• Recent advances in formal languages and applications.
• On Ordered RRWW-Automata
• Reversible Ordered Restarting Automata
• Ordered Restarting Automata for Picture Languages
• The Maximum Order of an Element of a Finite Symmetric Group
• Reversible Queue 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: Reversibility for stateless ordered RRWW-automata