Reversible top-down syntax analysis

DOI10.1007/978-3-030-81508-0_21OpenAlexW3189520617MaRDI QIDQ832945FDOQ832945

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

Recommendations

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

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

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

Cited In (3)

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

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)