Linear-Time Recognizable Classes of Tree Languages by Deterministic Linear Pushdown Tree Automata


IEICE TRANSACTIONS on Information and Systems   Vol.E92-D   No.2   pp.248-254
Publication Date: 2009/02/01
Online ISSN: 1745-1361
DOI: 10.1587/transinf.E92.D.248
Print ISSN: 0916-8532
Type of Manuscript: Special Section PAPER (Special Section on Foundations of Computer Science)
linear pushdown tree automaton,  context-free tree grammar,  tree structure,  linear-time recognizability,  

Full Text: PDF>>
Buy this Article

In this paper, we study deterministic linear pushdown tree automata (deterministic L-PDTAs) and some variations. Since recognition of an input tree by a deterministic L-PDTA can be done in linear time, deterministic L-PDTAs are applicable to many kinds of applications. A strict hierarchy will be shown among the classes of tree languages defined by a variety of deterministic L-PDTAs. It will be also shown that deterministic L-PDTAs are weakly equivalent to nondeterministic L-PDTAs.