Show simple item record

Files in this item

Thumbnail

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.identifier248206212
dc.identifierba26d15f-6ee4-428b-8230-dab728b8b587
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.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.format.extent603977
dc.language.isoeng
dc.relation.ispartofJournal of Automata, Languages Combinatoricsen
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.contributor.institutionUniversity of St Andrews. School of Computer Scienceen
dc.identifier.doi10.25596/jalc-2016-203
dc.description.statusPeer revieweden


This item appears in the following Collection(s)

Show simple item record