Rectangles and Squares Recognized by Two-Dimensional Automata
We consider sets of rectangles and squares recognized by deterministic and non-deterministic two-dimensional finite-state automata. We show that NFAs are strictly more powerful than DFAs, even for pictures over a one-symbol alphabet. In the process, we show that the pitcure languages recognized by NFAs are not closed under complement, resolving a long-standing open question. We also show that NFAs can only recognize sets of rectangles from the outside that correspond to simple regular languages. Finally, we show that sets of squares recognized by DFAs can be as sparse as any recursively enumerable set.
To our knowledge, this item is not available for
download. To find whether it is available, there are three
1. Check below under "Related research" whether another version of this item is available online.
2. Check on the provider's web page whether it is in fact available.
3. Perform a search for a similarly titled item that would be available.
|Date of creation:||Jun 2000|
|Contact details of provider:|| Postal: 1399 Hyde Park Road, Santa Fe, New Mexico 87501|
Web page: http://www.santafe.edu/sfi/publications/working-papers.html
More information through EDIRC
When requesting a correction, please mention this item's handle: RePEc:wop:safiwp:00-06-032. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Thomas Krichel)
If references are entirely missing, you can add them using this form.