See this document in CiteSeerX!

Complexity of Two-Dimensional Patterns (2000)  (Make Corrections)  (12 citations)
Kristian Lindgren, Cristopher Moore, Mats Nordahl



  Home/Search   Context   Related

 
View or download:
santafe.edu/pub/moore/tdl.ps
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  santafe.edu (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: In dynamical systems such as cellular automata and iterated maps, it is often useful to look at a language or set of symbol sequences produced by the system. There are well-established classification schemes, such as the Chomsky hierarchy, with which we can measure the complexity of these sets of sequences, and thus the complexity of the systems which produce them. In this paper, we look at the first few levels of a hierarchy of complexity for two-or-more-dimensional patterns. We show that... (Update)

Context of citations to this paper:   More

...with two possible tilings carry truth values, and junctions in these wires simulate logical gates. Similar approaches are taken in [6, 9, 11 13]. The question of whether a tiling exists then corresponds to the canonical NP complete problem Satis ability, which asks whether a...

...are as many queens as rows and such that no queen strike another queen is a recognizable picture language. This example is inspired by [17] where the 8 queens problem is treated. For instance, with the alphabet Sigma = f ; g, the two following pictures are in this...

Cited by:   More
Algebra of Networks - Modeling simple networks, as well as.. - Stefanescu   (Correct)
Quantifying Self-Organization in Cyclic Cellular Automata - Cosma Rohilla Shalizi   (Correct)
Spiral Galaxies Puzzles are NP-complete - Friedman   (Correct)

Similar documents (at the sentence level):
58.5%:   Complexity of Two-Dimensional Patterns - Lindgren, Moore, Nordahl (1997)   (Correct)

Active bibliography (related documents):   More   All
2.3:   New Results on Alternating and Non-Deterministic.. - Kari, Moore (2001)   (Correct)
1.2:   Rectangles and Squares Recognized By Two-Dimensional Automata - Kari, Moore   (Correct)
0.3:   -16 17 -1 - Fig Dislocation   (Correct)

Similar documents based on text:   More   All
0.3:   Technical and Economic Assessment of Hydrogen and Methanol.. - Jung (1999)   (Correct)
0.2:   Algebraic Properties of the Block Transformation on Cellular.. - Moore, Drisko (1995)   (Correct)
0.2:   Coevolving Pursuit-Evasion Strategies in Open and Confined.. - Wahde, Nordahl (1998)   (Correct)

Related documents from co-citation:   More   All
6:   A Survey of two-dimensional automata theory (context) - Inoue, Takanami - 1990
5:   Two-dimensional languages - Giammarresi, Restivo - 1997
4:   Monadic second-order logic over rectangular pictures and recognizability by tili.. (context) - Giammarresi, Restivo et al. - 1996

BibTeX entry:   (Update)

Lindgren, K., Moore, C., & Nordahl, M. (1997). Complexity of two-dimensional patterns. (Working Paper 97-03-023.) Santa Fe, NM: Santa Fe Institute. http://citeseer.ist.psu.edu/article/lindgren00complexity.html   More

@techreport{ lindgren97complexity,
    author = "K. Lindgren and C. Moore and M. Nordahl",
    title = "Complexity of Two-Dimensional Patterns",
    number = "97--03--023",
    year = "1997",
    url = "citeseer.ist.psu.edu/article/lindgren00complexity.html" }
Citations (may not include all citations):
4212   Computers and Intractability: A Guide to the Theory of NP-Co.. (context) - Garey, Johnson - 1979
1911   Introduction to Automata Theory (context) - Hopcroft, Ullman - 1979
951   Computational Complexity (context) - Papadimitriou - 1994  ACM
160   Exactly Solved Models in Statistical Mechanics (context) - Baxter - 1982
104   Automata-Theoretic Aspects of Formal Power Series (context) - Salomaa, Soittola - 1978
97   Limits to Parallel Computation: P-Completeness Theory - Greenlaw, Hoover et al. - 1995
64   On context-free languages (context) - Parikh - 1966  ACM   DBLP
58   The undecidability of the domino problem (context) - Berger - 1966
54   Computation at the onset of chaos (context) - Crutcheld, Young - 1990
47   Undecidability and nonperiodicity of tilings of the plane (context) - Robinson - 1971
46   Endomorphisms and automorphisms of the shift dynamical syste.. (context) - Hedlund - 1969
38   Computation theory of cellular automata (context) - Wolfram - 1984
37   Universal computation in simple onedimensional cellular auto.. (context) - Lindgren, Nordahl - 1990
36   Proving theorems by pattern recognition II (context) - Wang - 1961
34   erential Topology (context) - Guillemin, Pollack - 1974
23   Symbolic Dynamics and Coding (context) - Lind, Marcus - 1995
18   Halting space-bounded computations (context) - Sipser - 1980  DBLP
17   Lecture Notes in Computer Science (context) - Coy, Labyrinths - 1977
17   Recycling strange sets (context) - Artuso, Aurell et al. - 1990
16   Developmental systems without cellular interaction (context) - Lindenmayer - 1971
16   Linear time simulation of deterministic two-way pushdown aut.. (context) - Cook - 1971  DBLP
15   Monadic second order logic over rectangular pictures and rec.. (context) - Giammarresi, Restivo et al. - 1996
13   Two-dimensional cellular automata (context) - Packard, Wolfram - 1985
13   Computation: Finite and Innite Machines (context) - Minsky - 1967
13   Lecture Notes in Mathematics (context) - Kitchens, Schmidt et al. - 1988
12   A survey of two-dimensional automata theory (context) - Inoue, Takanami - 1991  ACM   DBLP
12   Complexity of two-dimensional patterns - Lindgren, Moore et al. - 1990
11   Formal language characterization of cellular automaton limit.. (context) - Hurd - 1987
8   Picture Languages: Formal Models for Picture Recognition (context) - Rosenfeld - 1979
6   Subshifts of nite type and soc systems (context) - Weiss - 1973
5   Tilings and Patterns (context) - Gr, Shepard - 1987
5   Recursive cellular automata invariant sets (context) - Hurd - 1990
4   The Expressive power of Transitive Closure and 2-way Multihe.. - Bargury, Makowsky - 1992
4   Correlations and random information in cellular automata (context) - Lindgren - 1987
4   A region crossing problem for array-bounded automata (context) - Milgram - 1976
4   Dynamical Systems and Bifurcations of Vector Fields (context) - instance, of et al. - 1983
3   Two-dimensional on-line tesselation acceptors are not closed.. (context) - Szepietowski - 1992
3   on Switching and Automata Theory (context) - Blum, Hewitt et al. - 1967
3   A positive pumping condition for regular sets (context) - de Luca, Varrichio - 1989  DBLP
3   Logarithmically slow domain growth in nonrandomly frustrated.. (context) - Shore, Holzer et al. - 1992
3   A General History of Labyrinths (context) - Haslam
3   Some properties of two-dimensional on-line tesselation accep.. (context) - Inoue, Nakamura - 1977
2   The global minimum of energy is not always a sum of local mi.. (context) - Mikiesz - 1993
2   the ergodic theory of cellular automata (context) - Willson - 1975
2   Two-dimensional nite automata and unacceptable functions (context) - Inoue, Nakamura - 1979
2   Growing perfect quasicrystals (context) - Onoda, Steinhardt et al. - 1988
2   of Pattern Recognition and Articial Intelligence (context) - Giammarresi, Restivo et al. - 1992
2   Global properties of cellular automata (context) - Jen - 1986
2   Tiling problems and undecidability in the cluster variation .. (context) - Schlijper - 1988
2   Three-dimensional connected pictures are not recognizable by.. (context) - Nakamura - 1992
2   Hard square entropy constant (context) - Finch
1   To appear in Handbook of Formal Languages (context) - Giammarresi, Restivo et al. - 1996
1   Unreconstructible at any radius (context) - Crutcheld - 1992
1   Information Processing Letters (context) - Goralcik, Goralcikova et al. - 1991
1   A note on two-dimensional nite automata (context) - Inoue, Nakamura et al. - 1978
1   Formal languages and nite cellular automata (context) - Nordahl - 1989
1   Towards nding exact residual entropies of the Ising antiferr.. (context) - Milo, Sto et al. - 1989



The graph only includes citing articles where the year of publication is known.


Documents on the same site (http://fermivista.math.jussieu.fr/ftp/ftp.santafe.edu.html):   More
ECA 18 Temporal Decay - Crutchfield, Hanson   (Correct)
Stochastic Modeling and Optimization of Phage Display - Levitan (1997)   (Correct)
An Agent Based Model for the Study of Publicity/consumer Dynamics. - Prieto   (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