Complexity and universality of iterated finite automata

zbMATH Open1159.68477MaRDI QIDQ3597129FDOQ3597129

Authors: Jiang Zhang 

Publication date: 9 February 2009

Recommendations

• scientific article; zbMATH DE number 3896307
• A comparison of finite and cellular automata
• scientific article
• scientific article; zbMATH DE number 17562
• Descriptional complexity of iterated uniform finite-state transducers

zbMATH Keywords

cellular automatonuniversal computation

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Cellular automata (computational aspects) (68Q80)

Cited In (5)

• The complexity of interacting automata
• Iterated stack automata and complexity classes
• Title not available (Why is that?)
• Universality of R-automata with Value Copying
• Complexity of some problems from the theory of automata

This page was built for publication: Complexity and universality of iterated finite automata

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3597129)