Non-self-embedding linear context-free tree grammars generate regular tree languages
MetadataShow full item record
For the class of linear context-free tree grammars, we dene a decidable property called self-embedding. We prove that each non-self-embedding grammar in this class generates a regular tree language and show how to construct the equivalent regular tree grammar.
Nederhof , M J , Teichman , M & Vogler , H 2016 , ' Non-self-embedding linear context-free tree grammars generate regular tree languages ' Journal of Automata Languages Combinatorics .
Journal of Automata Languages Combinatorics
© 2016, Institut für Informatik, Justus-Liebig-Universität Giessen. This work has been made available online by kind permission of the publisher. This is the author created manuscript following peer review accepted at JALC and may differ slightly from the final published version.
Items in the St Andrews Research Repository are protected by copyright, with all rights reserved, unless otherwise indicated.