Abstract
We present a new model of a two-dimensional computing device called sgraffito automaton and demonstrate its significance. In general, the model is simple, allows a clear design of important computations and defines families exhibiting good properties. It does not exceed the power of finite-state automata when working over one-dimensional inputs. On the other hand, it induces a family of picture languages that strictly includes REC and the deterministic variant recognizes languages in DREC as well as those accepted by four-way automata. © 2012 Springer-Verlag.
Author supplied keywords
Cite
CITATION STYLE
Průša, D., & Mráz, F. (2012). Two-dimensional sgraffito automata. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7410 LNCS, pp. 251–262). https://doi.org/10.1007/978-3-642-31653-1_23
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
