(Enter summary)
Abstract: We describe a class of transitive semiautomata whose power
automata are reduced: any two reachable sets of states have distinct behavior. (Update)
Active bibliography (related documents): More All
1.5: Reduced Power Automata - Sutner Computer Science
(Correct)
0.7: The Size of Power Automata - Sutner (1994)
(Correct)
0.4: Linear Cellular Automata and Fischer Automata - Sutner (1997)
(Correct)
BibTeX entry: (Update)
@misc{ sutner-reduced,
author = "K. Sutner",
title = "Reduced Power Automata",
url = "citeseer.ist.psu.edu/628384.html" }
Citations (may not include all citations):
151
Introduction to Symbolic Dynamics and Coding (context) - Lind, Marcus - 1995
46
Endomorphisms and automorphisms of the shift dynamical syste.. (context) - Hedlund - 1969
12
Symbolic dynamics and nite automata (context) - Beal, Perrin - 1997
12
Theoretical Computer Science (context) - Beauquier, for et al. - 1989
12
Linear cellular automata and Fischer automata
- Sutner - 1997
9
De Bruijn graphs and linear cellular automata (context) - Sutner - 1991
8
The size of power automata
- Sutner
7
systems and graphs (context) - Fischer - 1975
6
Linear Cellular Automata and De Bruijn Automata
- Sutner - 1999
5
Kluwer Academic Publishers (context) - Delorme, Mazoyer et al. - 1999
2
Representations of reversible automata and state graphs of v.. (context) - Badouel - 1998
Documents on the same site (http://www-2.cs.cmu.edu/~sutner/papers.html): More
Cellular Automata and Intermediate Degrees - Sutner (2002)
(Correct)
automata, a Hybrid System for Computational Automata Theory - Sutner
(Correct)
The Size of Power Automata - Sutner (1994)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC