scientific article; zbMATH DE number 7584596

MaRDI QIDQ5867516

Holger Bock Axelsen, Andreas Malcher, Martin Kutrib

Publication date: 14 September 2022

Full work available at URL: http://www.jalc.de/issues/2022/issue_27_1-3/jalc-2022-047-077.php

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

zbMATH Keywords

reversible computingunconventional models of computationChurch-Rosser languagesshrinking two-pushdown automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Unnamed Item
• Unnamed Item
• Universality of a reversible two-counter machine
• Growing context-sensitive languages and Church-Rosser languages
• Reversible space equals deterministic space
• Reversible pushdown automata
• The Church-Rosser languages are the deterministic variants of the growing context-sensitive languages
• One-way reversible multi-head finite automata
• Reversible Shrinking Two-Pushdown Automata
• A Hierarchy of Fast Reversible Turing Machines
• What Do Reversible Programs Compute?
• Two-Way Reversible Multi-Head Finite Automata
• Church-Rosser Thue systems and formal languages

This page was built for publication: