Complexity and universality of iterated finite automata (Q3597129)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Complexity and universality of iterated finite automata |
scientific article; zbMATH DE number 5504134
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity and universality of iterated finite automata |
scientific article; zbMATH DE number 5504134 |
Statements
9 February 2009
0 references
cellular automaton
0 references
universal computation
0 references
0.7096260190010071
0 references
0.6994958519935608
0 references
