State-limited inductive inference of cellular automata
From MaRDI portal
Cites work
- Algorithms for inferring context-sensitive L-systems
- An introduction to Kolmogorov complexity and its applications
- Cellular automata -- a computational point of view
- Cellular automata. A parallel model. Papers from the Spring School of Theoretical Computer Science, Saissac, France, 1996
- Cellular automata: descriptional complexity and decidability
- Grammatical inference. Learning automata and grammars.
- Handbook of Natural Computing
- scientific article; zbMATH DE number 3480114 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- The complexity of satisfiability problems
- Theory of cellular automata: a survey
- Theory of self-reproducing automata. Edited and completed by Arthur W. Burks
This page was built for publication: State-limited inductive inference of cellular automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7412091)