Simulating Two-Dimensional Recognizability by Pushdown and Queue Automata

The aim of this paper is to investigate sequential models to describe two-dimensional languages. The intent is to add more capabilities to 4NFA in order to encompass a wider class of languages. We show that any (tiling) recognizable language can be simulated by a 4NFA with an extra queue whose size...

Ausführliche Beschreibung

Bibliographische Detailangaben

Hauptverfasser:	Anselmo, Marcella, Madonia, Maria
Format:	Tagungsbericht
Sprache:	eng
Schlagworte:	Applied sciences Automata. Abstract machines. Turing machines Computer science control theory systems Exact sciences and technology Theoretical computing
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!