Show simple item record

Files in this item

Thumbnail
Name:
Nederhof_2016_Grammars_JALC_AAM.pdf
Size:
589.8Kb
Format:
PDF
View/Open

Non-self-embedding linear context-free tree grammars generate regular tree languages

Item metadata

dc.contributor.authorNederhof, Mark Jan
dc.contributor.authorTeichmann, Markus
dc.contributor.authorVogler, Heiko
dc.date.accessioned2016-12-20T17:30:13Z
dc.date.available2016-12-20T17:30:13Z
dc.date.issued2016-12-12
dc.identifier.citationNederhof , 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-203en
dc.identifier.issn1430-189X
dc.identifier.otherPURE: 248206212
dc.identifier.otherPURE UUID: ba26d15f-6ee4-428b-8230-dab728b8b587
dc.identifier.otherORCID: /0000-0002-1845-6829/work/46002703
dc.identifier.urihttps://hdl.handle.net/10023/9995
dc.description.abstractFor 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.language.isoeng
dc.relation.ispartofJournal of Automata, Languages Combinatoricsen
dc.rights© 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. The final published version of this work is available at https://doi.org/10.25596/jalc-2016-203en
dc.subjectContext-free tree grammaren
dc.subjectRegular tree grammaren
dc.subjectSelf-embeddingen
dc.subjectNatural language processingen
dc.subjectQA75 Electronic computers. Computer scienceen
dc.subjectComputational Theory and Mathematicsen
dc.subjectT-NDASen
dc.subjectBDCen
dc.subjectR2Cen
dc.subject~DC~en
dc.subject.lccQA75en
dc.titleNon-self-embedding linear context-free tree grammars generate regular tree languagesen
dc.typeJournal articleen
dc.description.versionPostprinten
dc.contributor.institutionUniversity of St Andrews. School of Computer Scienceen
dc.identifier.doihttps://doi.org/10.25596/jalc-2016-203
dc.description.statusPeer revieweden


This item appears in the following Collection(s)

Show simple item record

Items in the St Andrews Research Repository are protected by copyright, with all rights reserved, unless otherwise indicated.