Fast parallel language recognition by cellular automata

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
scientific article; zbMATH DE number 1418341
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

(36)

Languages not recognizable in real time by one-dimensional cellular automata
A speed-up of oblivious multi-head finite automata by cellular automata
Towards a basis for parallel language recognition by cellular automata
scientific article; zbMATH DE number 1836417 (Why is no real title available?)
A study on learning robustness using asynchronous 1D cellular automata rules
Fast reversible language recognition using cellular automata
Simulation of one-dimensional cellular automata by uniquely parallel parsable grammars.
A Study on the Automatic Generation of Asynchronous Cellular Automata Rules by Means of Genetic Algorithms
scientific article; zbMATH DE number 1512708 (Why is no real title available?)
Sublinear-time language recognition and decision by one-dimensional cellular automata
scientific article; zbMATH DE number 35424 (Why is no real title available?)
scientific article; zbMATH DE number 4047125 (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
On time reduction and simulation in cellular spaces
Definability by Horn formulas and linear time on cellular automata
Complexity-theoretic aspects of expanding cellular automata
On tally languages and generalized interacting automata
Parallel learning of automatic classes of languages
Pseudorandom generators for sliding-window algorithms
scientific article; zbMATH DE number 1886329 (Why is no real title available?)
Parallel recognition of rational languages in plane cellular automata
On One-Way Cellular Arrays
scientific article; zbMATH DE number 769370 (Why is no real title available?)
Some results on time-varying and relativised cellular automata^*
A characterization of constant-time cellular automata computation
The complexity of systolic dissemination of information in interconnection networks
Sublinear-Time Language Recognition and Decision by One-Dimensional Cellular Automata
scientific article; zbMATH DE number 572172 (Why is no real title available?)
A linear speed-up theorem for cellular automata
scientific article; zbMATH DE number 3926273 (Why is no real title available?)
A note on time-bounded bottom-up pyramid cellular acceptors
Fast language acceptance by shrinking cellular automata
Complexity-theoretic aspects of expanding cellular automata
scientific article; zbMATH DE number 3872685 (Why is no real title available?)
scientific article; zbMATH DE number 4028909 (Why is no real title available?)

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)