Deterministic Recognition of Trees Accepted by a Linear Pushdown Tree Automaton

In this paper, a deterministic recognition algorithm for the class of tree languages accepted by (nondeterministic) linear pushdown tree automata (L-PDTAs) is proposed. L-PDTAs accept an important class of tree languages since the class of their yield languages coincides with the class of yield lang...

Ausführliche Beschreibung

Bibliographische Detailangaben

Hauptverfasser:	Fujiyoshi, Akio, Kawaharada, Ikuo
Format:	Tagungsbericht
Sprache:	eng
Schlagworte:	Applied sciences Automata. Abstract machines. Turing machines Computer science control theory systems Exact sciences and technology Input Tree Recognition Algorithm Theoretical computing Tree Accept Tree Automaton Tree Language
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!