Real-time reversible iterative arrays

DOI10.1016/j.tcs.2009.10.017zbMath1183.68345OpenAlexW3004434164MaRDI QIDQ846369

Martin Kutrib, Andreas Malcher

Publication date: 9 February 2010

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2009.10.017

zbMATH Keywords

decidabilityclosure propertiesiterative arrayslanguage recognitionreal-time reversibility

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items

One-way reversible multi-head finite automata, Reversible top-down syntax analysis, One-Way Reversible Multi-head Finite Automata, Aspects of Reversibility for Classical Automata, Reversible and Irreversible Computations of Deterministic Finite-State Devices, Reversible Top-Down Syntax Analysis, When input-driven pushdown automata meet reversiblity, Reversible pushdown automata, Real-Time Reversible One-Way Cellular Automata

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Firing squad synchronization problem in reversible cellular automata
• Reversible simulation of one-dimensional irreversible cellular automata
• Fast reversible language recognition using cellular automata
• Computation-universality of one-dimensional one-way reversible cellular automata
• Computation and construction universality of reversible cellular automata
• Reversibility and surjectivity problems of cellular automata
• Theory of cellular automata: a survey
• Decision procedures for surjectivity and injectivity of parallel maps for tessellation structures
• Real-time language recognition by one-dimensional cellular automata
• Inference of Reversible Languages
• Real-Time Computation by n-Dimensional Iterative Arrays of Finite-State Machines
• Generation of Primes by a One-Dimensional Real-Time Iterative Array
• Logical Reversibility of Computation
• Automata, Languages and Programming
• Constructible functions in cellular automata and their applications to hierarchy results