A completeness property of one-dimensional tessellation automata

DOI10.1016/S0022-0000(76)80017-7zbMath0339.02031OpenAlexW2074273822MaRDI QIDQ1230776

Namio Honda, Masakazu Nasu

Publication date: 1976

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0022-0000(76)80017-7

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05)

Related Items (3)

A function for evaluating the computing time of a bubbling system ⋮ Pattern decomposition for tessellation automata ⋮ Local maps inducing surjective global maps of one-dimensional tessellation automata

Cites Work

• Completeness problem of one-dimensional binary scope-3 tessellation automata
• A completeness problem for pattern generation in tessellation automata
• Some regular state sets in the system of one-dimensional iterative automata

This page was built for publication: A completeness property of one-dimensional tessellation automata