Abstract
We consider sets of rectangles and squares recognized by deterministic and non-deterministic two-dimensional finite-state automata. We show that sets of squares recognized by DFAs from the inside can be as sparse as any recursively enumerable set. We also show that NFAs can only recognize sets of rectangles from the outside that correspond to simple regular languages. © Springer-Verlag Berlin Heidelberg 2004.
Cite
CITATION STYLE
Kari, J., & Moore, C. (2004). Rectangles and squares recognized by two-dimensional automata. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3113, 134–144. https://doi.org/10.1007/978-3-540-27812-2_13
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
