K. Sutner  Home/Search
Context Related
| cmu.edu/~sutner/papers...PowerAut.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: cmu.edu/~sutner/papers (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We describe a class of simple transitive semiautomata that exhibit full exponential blow-up during deterministic simulation. For arbitrary semiautomata we show that it is PSPACE-complete to decide whether the size of the accessible part of their power automata exceeds a given bound. 1 Motivation Consider the following semiautomaton A = h[n]; ; i where [n] = f1; : : : ; ng, = fa; b; cg and the transition function is given by a a cyclic shift on [n]; b the transposition that interchanges ... (Update)
Cited by: More
Reduced Power Automata - Sutner Computer Science (Correct)
automata, a Hybrid System for Computational - Automata Theory Sutner (Correct)
February 21, 2003 - Uploading Diculties On (Correct)
Active bibliography (related documents): More All
3.2: The Size of Power Automata - Sutner Computer Science (1994) (Correct)
0.7: Symbolic Dynamics and Finite Automata - Beal, Perrin (1999) (Correct)
0.6: Linear Cellular Automata and Fischer Automata - Sutner (1997) (Correct)
Similar documents based on text: More All
0.3: Linear Cellular Automata and de Bruijn Automata - Sutner (Correct)
0.3: automata, a Hybrid System for Computational Automata Theory - Sutner (Correct)
0.3: The Ehrenfeucht-Mycielski Sequence - Sutner Computer Science (Correct)
Related documents from co-citation: More All
6: Linear Cellular Automata and Fischer Automata - Sutner - 1997
5: systems and graphs (context) - Fischer - 1975
4: Symbolic dynamics and nite automata (context) - Perrin
BibTeX entry: (Update)
D. Landaeta and K. Sutner. The size of power automata. In preparation., 1994. http://citeseer.ist.psu.edu/article/sutner94size.html More
@article{ sutner01size,
author = "Klaus Sutner",
title = "The Size of Power Automata",
journal = "Lecture Notes in Computer Science",
volume = "2136",
pages = "666--??",
year = "2001",
url = "citeseer.ist.psu.edu/article/sutner94size.html" }
Citations (may not include all citations):572 Computers and Intractability (context) - Garey, Johnson - 1979
151 Introduction to Symbolic Dynamics and Coding (context) - Lind, Marcus - 1995
114 Theory and Applications of Cellular Automata (context) - Wolfram - 1986
56 Lower bounds for natural proof systems (context) - Kozen - 1977
46 Endomorphisms and automorphisms of the shift dynamical syste.. (context) - Hedlund - 1969
16 Computational mechanics of cellular automata (context) - Hanson, Crutcheld - 1995
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
11 Formal language characterizations of cellular automata limit.. (context) - Hurd - 1987
8 Twenty problems in the theory of cellular automata (context) - Wolfram - 1985
7 the composition of functions of several variables ranging ov.. (context) - Salomaa - 1960
6 Linear Cellular Automata and De Bruijn Automata - Sutner - 1999
6 Subshifts of nite type and soc systems (context) - Weiss - 1973
5 Plenum Publishing Corporation - Pin, Formal et al. - 1986
5 Kluwer Academic Publishers (context) - Delorme, Mazoyer et al. - 1999
4 the limit set of some universal cellular automata (context) - Goles, Maass et al. - 1993
3 any-valued truth functions, ^ Cerny's conjecture and road c.. (context) - Salomaa - 1999
3 Private communication (context) - Ravikumar - 1994
3 On minimizing nite automata (context) - Brauer - 1988
2 Soc systems and graphs (context) - Fischer - 1975
2 Finite Automata: Behavior and Sythesis (context) - Trakhtenbrot, Barzdin - 1973
Documents on the same site (http://www.cs.cmu.edu/~sutner/papers.html): More
Decomposition of Additive CA - Sutner (Correct)
sigma-Automata and Chebyshev-Polynomials - Sutner (1996) (Correct)
Cellular Automata and Intermediate Reachability Problems - Sutner Computer Science (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