Published in: LIPIcs, Volume 4, IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (2009)
Christof Löding and Karianto Wong. On Nondeterministic Unranked Tree Automata with Sibling Constraints. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), Volume 4, pp. 311-322, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)
@InProceedings{loding_et_al:LIPIcs.FSTTCS.2009.2328, author = {L\"{o}ding, Christof and Wong, Karianto}, title = {{On Nondeterministic Unranked Tree Automata with Sibling Constraints}}, booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science}, pages = {311--322}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-13-2}, ISSN = {1868-8969}, year = {2009}, volume = {4}, editor = {Kannan, Ravi and Narayan Kumar, K.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2009.2328}, URN = {urn:nbn:de:0030-drops-23281}, doi = {10.4230/LIPIcs.FSTTCS.2009.2328}, annote = {Keywords: Unranked tree automata, equality and disequality constraints, monadic second-order logic} }
Feedback for Dagstuhl Publishing