Skip to main content
Conference Proceedings

Restarting tree automata and linear context-free tree languages

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2007) 4728 LNCS 275-289
DOI: 10.1007/978-3-540-75414-5_18
4Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We derive a normal form for linear context-free tree grammars that involves only growing productions. Based on this normal form we then show that all linear context-free tree languages are recognized by restarting tree automata which utilize auxiliary symbols. © Springer-Verlag Berlin Heidelberg 2007.

Cite

CITATION STYLE

APA

Stamer, H., & Otto, F. (2007). Restarting tree automata and linear context-free tree languages. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4728 LNCS, pp. 275–289). Springer Verlag. https://doi.org/10.1007/978-3-540-75414-5_18

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free