Fast parallel language recognition by cellular automata
From MaRDI portal
Recommendations
- Towards a basis for parallel language recognition by cellular automata
- Fast reversible language recognition using cellular automata
- Language recognition by reversible partitioned cellular automata and iterative arrays
- Language recognition by reversible partitioned cellular automata
- scientific article; zbMATH DE number 1254096
- scientific article; zbMATH DE number 572172
- scientific article; zbMATH DE number 1759473
- Parallel recognition of rational languages in plane cellular automata
- Publication:4941904
- Sublinear-Time Language Recognition and Decision by One-Dimensional Cellular Automata
Cites work
- scientific article; zbMATH DE number 3738961 (Why is no real title available?)
- scientific article; zbMATH DE number 3338162 (Why is no real title available?)
- Characterizations and computational complexity of systolic trellis automata
- Computational Complexity of One-Tape Turing Machine Computations
- One-way bounded cellular automata
- Parallel language recognition in constant time by cellular automata
- Real-time language recognition by one-dimensional cellular automata
- Sequential Machine Characterizations of Trellis and Cellular Automata and Applications
Cited in
(35)- A note on time-bounded bottom-up pyramid cellular acceptors
- scientific article; zbMATH DE number 572172 (Why is no real title available?)
- Fast reversible language recognition using cellular automata
- Towards a basis for parallel language recognition by cellular automata
- A speed-up of oblivious multi-head finite automata by cellular automata
- Languages not recognizable in real time by one-dimensional cellular automata
- Simulation of one-dimensional cellular automata by uniquely parallel parsable grammars.
- The complexity of systolic dissemination of information in interconnection networks
- scientific article; zbMATH DE number 1836417 (Why is no real title available?)
- Lower bounds and hardness magnification for sublinear-time shrinking cellular automata
- A symbiosis between cellular automata and genetic algorithms
- scientific article; zbMATH DE number 4047125 (Why is no real title available?)
- Definability by Horn formulas and linear time on cellular automata
- On time reduction and simulation in cellular spaces
- Sublinear-Time Language Recognition and Decision by One-Dimensional Cellular Automata
- scientific article; zbMATH DE number 4028909 (Why is no real title available?)
- A characterization of constant-time cellular automata computation
- A linear speed-up theorem for cellular automata
- scientific article; zbMATH DE number 769370 (Why is no real title available?)
- Parallel recognition of rational languages in plane cellular automata
- A Study on the Automatic Generation of Asynchronous Cellular Automata Rules by Means of Genetic Algorithms
- Complexity-theoretic aspects of expanding cellular automata
- scientific article; zbMATH DE number 1886329 (Why is no real title available?)
- scientific article; zbMATH DE number 1512708 (Why is no real title available?)
- Complexity-theoretic aspects of expanding cellular automata
- A study on learning robustness using asynchronous 1D cellular automata rules
- On tally languages and generalized interacting automata
- Some results on time-varying and relativised cellular automata*
- Parallel learning of automatic classes of languages
- On One-Way Cellular Arrays
- scientific article; zbMATH DE number 35424 (Why is no real title available?)
- scientific article; zbMATH DE number 3926273 (Why is no real title available?)
- scientific article; zbMATH DE number 3872685 (Why is no real title available?)
- Fast language acceptance by shrinking cellular automata
- Sublinear-time language recognition and decision by one-dimensional cellular automata
This page was built for publication: Fast parallel language recognition by cellular automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1075053)
