Language recognition by reversible partitioned cellular automata
From MaRDI portal
(Redirected from Language recognition by reversible partitioned cellular automata)
Recommendations
- Language recognition by reversible partitioned cellular automata and iterative arrays
- Fast reversible language recognition using cellular automata
- Fast one-way cellular automata with reversible Mealy cells
- Reversible cellular automaton able to simulate any other reversible one using partitioning automata
- Real-time reversible one-way cellular automata
Cites work
- A deterministic two-way multi-head finite automaton can be converted into a reversible one with the same number of heads
- Fast reversible language recognition using cellular automata
- Real-time language recognition by one-dimensional cellular automata
- Reversible space equals deterministic space
- Simulating reversible Turing machines and cyclic tag systems by one-dimensional reversible cellular automata
- Two-way reversible multi-head finite automata
Cited in
(8)- Fast parallel language recognition by cellular automata
- Fast one-way cellular automata with reversible Mealy cells
- scientific article; zbMATH DE number 572172 (Why is no real title available?)
- scientific article; zbMATH DE number 1886329 (Why is no real title available?)
- scientific article; zbMATH DE number 769370 (Why is no real title available?)
- Language recognition by reversible partitioned cellular automata and iterative arrays
- Sublinear-Time Language Recognition and Decision by One-Dimensional Cellular Automata
- Fast reversible language recognition using cellular automata
This page was built for publication: Language recognition by reversible partitioned cellular automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5501617)
