Reversible top-down syntax analysis
From MaRDI portal
Publication:832945
DOI10.1007/978-3-030-81508-0_21OpenAlexW3189520617MaRDI QIDQ832945
Publication date: 25 March 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-81508-0_21
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Reversible simulation of one-dimensional irreversible cellular automata
- Real-time reversible iterative arrays
- Reversible computing and cellular automata -- a survey
- Fast reversible language recognition using cellular automata
- Reversible pushdown automata
- Top-down syntax nalysis
- Aspects of Reversibility for Classical Automata
- Reversible and Irreversible Computations of Deterministic Finite-State Devices
- Degrees of Reversibility for DFA and DPDA
- Irreversibility and Heat Generation in the Computing Process
- Inference of Reversible Languages
- Minimal Reversible Deterministic Finite Automata
- Developments in Language Theory
- Real-Time Reversible One-Way Cellular Automata
- Syntax-Directed Transduction
- Properties of deterministic top-down grammars
- Logical Reversibility of Computation
This page was built for publication: Reversible top-down syntax analysis
