Files in this item
Non-self-embedding linear context-free tree grammars generate regular tree languages
Item metadata
dc.contributor.author | Nederhof, Mark Jan | |
dc.contributor.author | Teichmann, Markus | |
dc.contributor.author | Vogler, Heiko | |
dc.date.accessioned | 2016-12-20T17:30:13Z | |
dc.date.available | 2016-12-20T17:30:13Z | |
dc.date.issued | 2016-12-12 | |
dc.identifier | 248206212 | |
dc.identifier | ba26d15f-6ee4-428b-8230-dab728b8b587 | |
dc.identifier.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 | en |
dc.identifier.issn | 1430-189X | |
dc.identifier.other | ORCID: /0000-0002-1845-6829/work/46002703 | |
dc.identifier.uri | https://hdl.handle.net/10023/9995 | |
dc.description.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. | |
dc.format.extent | 603977 | |
dc.language.iso | eng | |
dc.relation.ispartof | Journal of Automata, Languages Combinatorics | en |
dc.subject | Context-free tree grammar | en |
dc.subject | Regular tree grammar | en |
dc.subject | Self-embedding | en |
dc.subject | Natural language processing | en |
dc.subject | QA75 Electronic computers. Computer science | en |
dc.subject | Computational Theory and Mathematics | en |
dc.subject | T-NDAS | en |
dc.subject | BDC | en |
dc.subject | R2C | en |
dc.subject | ~DC~ | en |
dc.subject.lcc | QA75 | en |
dc.title | Non-self-embedding linear context-free tree grammars generate regular tree languages | en |
dc.type | Journal article | en |
dc.contributor.institution | University of St Andrews. School of Computer Science | en |
dc.identifier.doi | 10.25596/jalc-2016-203 | |
dc.description.status | Peer reviewed | en |
This item appears in the following Collection(s)
Items in the St Andrews Research Repository are protected by copyright, with all rights reserved, unless otherwise indicated.