Reduced power automata

Authors:
Klaus Sutner
Affiliations:
Computer Science Department, Carnegie Mellon University, Pittsburgh, PA
Venue:
CIAA'02 Proceedings of the 7th international conference on Implementation and application of automata
Year:
2002

Citing 5
Cited 0

Minimal automation for a factorial, transitive, and rational language

Theoretical Computer Science
An introduction to symbolic dynamics and coding

An introduction to symbolic dynamics and coding
Symbolic dynamics and finite automata

Handbook of formal languages, vol. 2
Linear cellular automata and Fischer automata

Parallel Computing - Special issue: cellular automata
A new kind of science

A new kind of science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We describe a class of transitive semiautomata whose power automata are reduced: any two reachable sets of states have distinct behavior. These automata appear naturally in the study of one-dimensional cellular automata.