Concise representations of reversible automata

DOI10.1142/S0129054119400331MaRDI QIDQ5205047zbMATH OpenOpenAlexWikidataFDO

Authors Giovanna J. Lavado, Luca Prigioniero

Publication date 10 December 2019

Published in International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s0129054119400331

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Concise representations of reversible automata
• On the efficient construction of quasi-reversible automata for reversible languages
• scientific article; zbMATH DE number 2086620
• A lower bound for reversible automata
• Reversible languages having finitely many reduced automata

Cites work

• scientific article; zbMATH DE number 3664335 (Why is no real title available?)
• scientific article; zbMATH DE number 3692653 (Why is no real title available?)
• scientific article; zbMATH DE number 7444007 (Why is no real title available?)
• Aspects of reversibility for classical automata
• Concise representations of reversible automata
• Degrees of reversibility for DFA and DPDA
• Introduction to algorithms.
• Irreversibility and Heat Generation in the Computing Process
• Logical Reversibility of Computation
• Minimal and reduced reversible automata
• Minimal reversible deterministic finite automata
• Reversible and irreversible computations of deterministic finite-state devices
• Reversible languages having finitely many reduced automata
• Reversible space equals deterministic space

Cited in

(10)

• Reactive automata
• When input-driven pushdown automata meet reversiblity
• On a compact encoding of the swap automaton
• scientific article; zbMATH DE number 2086620 (Why is no real title available?)
• Minimal and Reduced Reversible Automata
• A lower bound for reversible automata
• Weakly and Strongly Irreversible Regular Languages
• Reversible computations of one-way counter automata
• Reversible pushdown transducers
• Concise representations of reversible automata

This page was built for publication: Concise representations of reversible automata

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