Jarkko Kari, Cristopher Moore  Home/Search
Context Related
Links: ACM DBLP | santafe.edu/pub/moore/afa.ps 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: santafe.edu/~moore/pubs/afa (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: . We resolve several long-standing open questions regarding the power of various types of nite-state automata to recognize \picture languages," i.e. sets of two-dimensional arrays of symbols. We show that the languages recognized by 4-way alternating nite-state automata (AFAs) are incomparable to the so-called tiling recognizable languages. Speci cally, we show that the set of acyclic directed graphs is AFArecognizable but not tiling recognizable, while the set of non-acyclic directed... (Update)
Cited by: More
On the Computation Power of Finite Automata in.. - Kurganskyy, Potapov (2004) (Correct)
Similar documents (at the sentence level):
13.5%: Rectangles and Squares Recognized By Two-Dimensional Automata - Kari, Moore (Correct)
Active bibliography (related documents): More All
2.3: Complexity of Two-Dimensional Patterns - Lindgren, Moore, Nordahl (2000) (Correct)
0.3: Two-Dimensional Languages - Giammarresi, Restivo (1997) (Correct)
0.2: On some Recognizable Picture-languages - Reinhardt (1998) (Correct)
System load high. Please wait...
Timeout. Please try your query later.
Similar documents based on text: More All
0.7: A Characterization of Recognizable Picture Languages By Tilings.. - Simplot (1999) (Correct)
0.3: Incremental Construction of Compact Acyclic NFAs - Sgarbas, Fakotakis, Kokkinakis (Correct)
0.2: Aritmetic Compression of Weighted Finite Automata - Kari, Fränti (Correct)
Related documents from co-citation: More All
2: Indistinguishability of nite automata interacting with an environment [in Russia.. (context) - Grunsky, Kurganskyy - 1993
BibTeX entry: (Update)
C.Moore and J. Kari. New Results on Alternating and Non-Deterministic TwoDimensional Finite-State Automata. International Symposium on Theoretical Aspects of Computer Science, STACS (2001) 396-406 http://citeseer.ist.psu.edu/moore01new.html More
@article{ kari01new,
author = "Jarkko Kari and Cristopher Moore",
title = "New Results on Alternating and Non-deterministic Two-Dimensional Finite-State Automata",
journal = "Lecture Notes in Computer Science",
volume = "2010",
pages = "396--??",
year = "2001",
url = "citeseer.ist.psu.edu/moore01new.html" }
Citations (may not include all citations):32 Two-dimensional languages - Giammarresi, Restivo - 1996 ACM
18 Halting space-bounded computations (context) - Sipser - 1980 DBLP
13 Computation: Finite and Innite Machines (context) - Minsky - 1967
12 A survey of two-dimensional automata theory (context) - Inoue, Takanami - 1991 ACM DBLP
12 Complexity of two-dimensional patterns - Lindgren, Moore et al. - 1998
10 uni-heidelberg (context) - Borchert, math
8 Picture Languages: Formal Models for Picture Recognition (context) - Rosenfeld - 1979
4 A region crossing problem for array-bounded automata (context) - Milgram - 1976 DBLP
4 Some properties of two-dimensional on-line tessellation acce.. (context) - Inoue, Nakamura - 1977
3 on Switching and Automata Theory (context) - Blum, Hewitt et al. - 1967
3 Two-dimensional on-line tesselation acceptors are not closed.. (context) - Szepietowski - 1992
2 of Pattern Recognition and Articial Intelligence (context) - Giammarresi, Restivo et al. - 1992
2 Two-dimensional nite automata and unacceptable functions (context) - Inoue, Nakamura - 1979
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