Non-self-embedding linear context-free tree grammars generate regular tree languages
Abstract
For the class of linear context-free tree grammars, we define 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.
Citation
Nederhof , M J , Teichmann , M & Vogler , H 2016 , ' Non-self-embedding linear context-free tree grammars generate regular tree languages ' , Journal of Automata, Languages Combinatorics , vol. 21 , no. 3 , pp. 203-246 . https://doi.org/10.25596/jalc-2016-203
Publication
Journal of Automata, Languages Combinatorics
Status
Peer reviewed
ISSN
1430-189XType
Journal article
Collections
Items in the St Andrews Research Repository are protected by copyright, with all rights reserved, unless otherwise indicated.