scientific article; zbMATH DE number 7800498

arXiv2208.14720MaRDI QIDQ6190438

Martin Kutrib, Andreas Malcher

Publication date: 6 February 2024

Full work available at URL: https://arxiv.org/abs/2208.14720

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Mathematical logic and foundations (03-XX) Computer science (68-XX)

Cites Work

• Reversible simulation of one-dimensional irreversible cellular automata
• Recursive unsolvability of Post's problem of Tag und other topics in theory of Turing machines
• Remarks on the complexity of nondeterministic counter languages
• Universality of a reversible two-counter machine
• Reversible pushdown automata
• Regular languages accepted by quantum automata
• Energy complexity of regular language recognition
• What makes some language theory problems undecidable
• Quantum Finite Automata: A Modern Introduction
• SIMULATIONS BY TIME-BOUNDED COUNTER MACHINES
• Inference of Reversible Languages
• Minimal Reversible Deterministic Finite Automata
• Concise Representations of Reversible Automata
• Counter machines and counter languages
• Logical Reversibility of Computation
• MULTI-PUSH-DOWN LANGUAGES AND GRAMMARS
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item