Reversible Computations of One-Way Counter Automata

DOI10.1051/ITA/2023011MaRDI QIDQ6129079OpenAlexFDO

Authors Martin Kutrib, Andreas Malcher

Publication date 16 April 2024

Published in RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1051/ita/2023011

zbMATH Keywords

Kolmogorov complexityreversible computingcomputational capacitydecidability questionsmulti-counter automatacounter hierarchy

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Recommendations

• Reversible computations of one-way counter automata
• One-way reversible multi-head finite automata
• scientific article; zbMATH DE number 3982518
• One-way reversible multi-head finite automata
• One-reversal counter machines and multihead automata: revisited

Cited in

(1)

• Reversible computations of one-way counter automata

This page was built for publication: Reversible Computations of One-Way Counter Automata

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6129079)