scientific article

zbMath0458.68013MaRDI QIDQ3908465

No author found.

Publication date: 1981

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

complexity measure for the recognition of languages

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Cellular automata (computational aspects) (68Q80)

Related Items (12)

A survey of two-dimensional automata theory ⋮ Counter machines and distributed automata -- a story about exchanging space and time ⋮ Some remarks about the efficiency of polyautomata ⋮ Emptiness problems for distributed automata ⋮ Cold dynamics in cellular automata: a tutorial ⋮ Cellular automata with sparse communication ⋮ Parallel language recognition in constant time by cellular automata ⋮ On One-way One-bit O (One)-message Cellular Automata ⋮ Cellular Automata with Sparse Communication ⋮ Parallel turing machines with one-head control units and cellular automata ⋮ The mirage of universality in cellular automata ⋮ Freezing, Bounded-Change and Convergent Cellular Automata

This page was built for publication: