Two-dimensional sgraffito automata

Authors:
Daniel Průša;František Mráz
Affiliations:
Faculty of Electrical Engineering, Czech Technical University, Prague 2, Czech Republic;Faculty of Mathematics and Physics, Charles University, Prague 1, Czech Republic
Venue:
DLT'12 Proceedings of the 16th international conference on Developments in Language Theory
Year:
2012

Citing 5
Cited 1

Two-dimensional languages

Handbook of formal languages, vol. 3
New Results on Alternating and Non-deterministic Two-Dimensional Finite-State Automata

STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
Formal languages and their relation to automata

Formal languages and their relation to automata
Automata on a 2-dimensional tape

FOCS '67 Proceedings of the 8th Annual Symposium on Switching and Automata Theory (SWAT 1967)
From determinism to non-determinism in recognizable two-dimensional languages

DLT'07 Proceedings of the 11th international conference on Developments in language theory

Comparing two-dimensional one-marker automata to sgraffito automata

CIAA'13 Proceedings of the 18th international conference on Implementation and Application of Automata

Quantified Score

Hi-index	0.00

Visualization

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.