Journal of Computer and System Sciences
The equivalence of four extensions of context-free grammars
Mathematical Systems Theory
Term rewriting and all that
Indexed Grammars—An Extension of Context-Free Grammars
Journal of the ACM (JACM)
On Restarting Automata with Rewriting
New Trends in Formal Languages - Control, Cooperation, and Combinatorics (to Jürgen Dassow on the occasion of his 50th birthday)
Tree-oriented proofs of some theorems on context-free and indexed languages
STOC '70 Proceedings of the second annual ACM symposium on Theory of computing
Closure properties of linear context-free tree languages with an application to optimality theory
Theoretical Computer Science - Algebraic methods in language processing
Restrictions on monadic context-free tree grammars
COLING '04 Proceedings of the 20th international conference on Computational Linguistics
Grammars with macro-like productions
SWAT '68 Proceedings of the 9th Annual Symposium on Switching and Automata Theory (swat 1968)
Linearity and nondeletion on monadic context-free tree grammars
Information Processing Letters
Restarting automata and their relations to the Chomsky hierarchy
DLT'03 Proceedings of the 7th international conference on Developments in language theory
Single-Path Restarting Tree Automata
CAI '09 Proceedings of the 3rd International Conference on Algebraic Informatics
Strong lexicalization of tree adjoining grammars
ACL '12 Proceedings of the 50th Annual Meeting of the Association for Computational Linguistics: Long Papers - Volume 1
| Hi-index | 0.00 |
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.