Complete symmetry in d2l systems and cellular automata

DOI10.1080/00207168608803517zbMath0655.68066OpenAlexW3023251014MaRDI QIDQ3802630

Peter R. J. Asveld

Publication date: 1986

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://research.utwente.nl/en/publications/complete-symmetry-in-d2l-systems-and-cellular-automata(2818d826-a7e9-4712-a0c4-2b965f50c31b).html

zbMATH Keywords

cellular automatarecursively enumerable languagesTuring machine computationsspace-bounded complexity classescompletely symmetric D2L systems

Mathematics Subject Classification ID

Related Items (1)

On the generating power of regularly controlled bidirectional grammars

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Deterministic Lindenmayer languages, nonterminals and homomorphisms
• On the existence of generators for certain AFL
• A generator of context-sensitive languages
• Fixed Point Languages, Equality Languages, and Representation of Recursively Enumerable Languages
• On Relations Defined by Generalized Finite Automata
• A note on some systems of lindenmayer
• Simple Computation-Universal Cellular Spaces
• I. General description and the problem of universal computing ability
• Models for cellular interactions in development without polarity of individual cells II. Problems of synchronization and regulation

This page was built for publication: Complete symmetry in d2l systems and cellular automata