Fast reversible language recognition using cellular automata
From MaRDI portal
Publication:948083
DOI10.1016/J.IC.2008.03.015zbMATH Open1154.68082OpenAlexW1981094023MaRDI QIDQ948083FDOQ948083
Authors: Martin Kutrib, Andreas Malcher 
Publication date: 8 October 2008
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ic.2008.03.015
Recommendations
- Real-time reversible one-way cellular automata
- Fast one-way cellular automata with reversible Mealy cells
- Language recognition by reversible partitioned cellular automata and iterative arrays
- Fast parallel language recognition by cellular automata
- Language recognition by reversible partitioned cellular automata
cellular automataclosure propertieslanguage recognitiondecidability questionsreal-time reversible computations
Cites Work
- Theory of cellular automata: a survey
- Logical Reversibility of Computation
- Reversibility and surjectivity problems of cellular automata
- Decision procedures for surjectivity and injectivity of parallel maps for tessellation structures
- Inference of Reversible Languages
- Invertible cellular automata: A review
- Computation and construction universality of reversible cellular automata
- Computation-universality of one-dimensional one-way reversible cellular automata
- Firing squad synchronization problem in reversible cellular automata
- Reversible simulation of one-dimensional irreversible cellular automata
- Title not available (Why is that?)
- Automata, Languages and Programming
Cited In (25)
- Languages not recognizable in real time by one-dimensional cellular automata
- Language recognition by reversible partitioned cellular automata
- Reversible top-down syntax analysis
- Real-time reversible iterative arrays
- One-way reversible multi-head finite automata
- Language recognition by reversible partitioned cellular automata and iterative arrays
- When input-driven pushdown automata meet reversiblity
- Reversible limited automata
- Cellular Automata with Sparse Communication
- Reversible pushdown automata
- Aspects of reversibility for classical automata
- Real-time reversible one-way cellular automata
- Title not available (Why is that?)
- Reversible Top-Down Syntax Analysis
- String generation by cellular automata
- Cellular automata with sparse communication
- Title not available (Why is that?)
- Fast parallel language recognition by cellular automata
- Sublinear-Time Language Recognition and Decision by One-Dimensional Cellular Automata
- Title not available (Why is that?)
- Title not available (Why is that?)
- One-way reversible multi-head finite automata
- Queue Automata: Foundations and Developments
- Fast one-way cellular automata with reversible Mealy cells
- Reversible and irreversible computations of deterministic finite-state devices
This page was built for publication: Fast reversible language recognition using cellular automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q948083)
