Jarkko Kari, Cristopher Moore  Home/Search
Context
Related
| santafe.edu/pub/moore/picture.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...picture (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: this paper, we resolve this question and show that NFAs are not closed under complement. In addition, we show that NFAs are more powerful than DFAs, even for rectangles of a single symbol. We note that recognition of rectangles by NFAs, in the context of "recognizable functions," is studied in [6], where some upper bounds are shown. (Update)
Similar documents (at the sentence level):
10.3%: New Results on Alternating and Non-Deterministic.. - Kari, Moore (2001) (Correct)
Active bibliography (related documents): More All
1.2: Complexity of Two-Dimensional Patterns - Lindgren, Moore, Nordahl (2000) (Correct)
0.5: Two-Dimensional Languages - Giammarresi, Restivo (1997) (Correct)
0.4: Computing with Shapes - Bottoni, Mauri (Correct)
Similar documents based on text: More All
0.6: A Characterization of Recognizable Picture Languages By Tilings.. - Simplot (1999) (Correct)
0.4: Incremental Construction of Compact Acyclic NFAs - Sgarbas, Fakotakis, Kokkinakis (Correct)
0.3: Communication Complexity Method for Measuring.. - Hromkovic.. (Correct)
BibTeX entry: (Update)
@misc{ kari-rectangles,
author = "Jarkko Kari and Cristopher Moore",
title = "Rectangles and Squares Recognized By Two-Dimensional Automata",
url = "citeseer.ist.psu.edu/306132.html" }
Citations (may not include all citations):177 Computation: Finite and Infinite Machines (context) - Minsky - 1967
32 Two-dimensional languages - Giammarresi, Restivo - 1996 ACM
18 Halting space-bounded computations (context) - Sipser - 1980 DBLP
12 Complexity of two-dimensional patterns - Lindgren, Moore et al. - 1998
12 A survey of two-dimensional automata theory (context) - Inoue, Takanami - 1991 ACM DBLP
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
3 Recognizable picture languages (context) - Giammarresi, Restivo - 1992 ACM DBLP
3 on Switching and Automata Theory (context) - Blum, Hewitt et al. - 1967
3 Some properties of two-dimensional on-line tesselation accep.. (context) - Inoue, Nakamura - 1977
2 Two-dimensional finite 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