Reversible top-down syntax analysis

DOI10.1007/978-3-030-81508-0_21MaRDI QIDQ832945OpenAlexFDO

Authors Martin Kutrib, Uwe Meyer

Publication date 25 March 2022

Full work available at URL https://doi.org/10.1007/978-3-030-81508-0_21

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Reversible pushdown automata
• Reversible pushdown automata
• Degrees of reversibility for DFA and DPDA
• Boosting reversible pushdown machines by preprocessing
• Reversible limited automata

Cites work

• scientific article; zbMATH DE number 3856438 (Why is no real title available?)
• scientific article; zbMATH DE number 3639163 (Why is no real title available?)
• Aspects of reversibility for classical automata
• Degrees of reversibility for DFA and DPDA
• Developments in Language Theory
• Fast reversible language recognition using cellular automata
• Inference of Reversible Languages
• Irreversibility and Heat Generation in the Computing Process
• Logical Reversibility of Computation
• Minimal reversible deterministic finite automata
• Properties of deterministic top-down grammars
• Real-time reversible iterative arrays
• Real-time reversible one-way cellular automata
• Reversible and irreversible computations of deterministic finite-state devices
• Reversible computing and cellular automata -- a survey
• Reversible pushdown automata
• Reversible simulation of one-dimensional irreversible cellular automata
• Syntax-Directed Transduction
• Top-down syntax nalysis

Cited in

(3)

• Syntax checking either way
• Degrees of reversibility for DFA and DPDA
• Reversible Top-Down Syntax Analysis

This page was built for publication: Reversible top-down syntax analysis

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