The size of power automata.

DOI10.1016/S0304-3975(02)00413-9zbMath1044.68103MaRDI QIDQ1401251

Klaus Sutner

Publication date: 17 August 2003

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

Cellular automataState complexityDeterministic automataTransitive semiautomata

Mathematics Subject Classification ID

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

Related Items (1)

Five Determinisation Algorithms

Cites Work

• Partial orders on words, minimal elements of regular languages, and state complexity
• Intersection and union of regular languages and state complexity
• Sofic systems and graphs
• Minimal automaton for a factorial, transitive, and rational language
• Subshifts of finite type and sofic systems
• Separating Exponentially Ambiguous Finite Automata from Polynomially Ambiguous Finite Automata
• Twenty Problems in the Theory of Cellular Automata
• An Introduction to Symbolic Dynamics and Coding
• Nondeterminism and the size of two way finite automata
• Endomorphisms and automorphisms of the shift dynamical system
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The size of power automata.