On Nondeterministic Unranked Tree Automata with Sibling Constraints

Löding, Christof; Wong, Karianto

doi:10.4230/LIPIcs.FSTTCS.2009.2328

Document

On Nondeterministic Unranked Tree Automata with Sibling Constraints

Authors Christof Löding, Karianto Wong

Part of: Volume: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2009)
Part of: Series: Leibniz International Proceedings in Informatics (LIPIcs)
Part of: Conference: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS)
License: Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported license
Publication Date: 2009-12-14

PDF

File

PDF

LIPIcs.FSTTCS.2009.2328.pdf

Filesize: 222 kB
12 pages

Document Identifiers

DOI: 10.4230/LIPIcs.FSTTCS.2009.2328
URN: urn:nbn:de:0030-drops-23281

Subject Classification

Keywords

Unranked tree automata
equality and disequality constraints
monadic second-order logic

Metrics

Access Statistics
Total Accesses (updated on a weekly basis)

0

PDF Downloads

0

Metadata Views

Abstract

We continue the study of bottom-up unranked tree automata with equality and
 disequality constraints between direct subtrees.  In particular, we show that
 the emptiness problem for the nondeterministic automata is decidable.  In
 addition, we show that the universality problem, in contrast, is undecidable.

Cite As Get BibTex

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) https://doi.org/10.4230/LIPIcs.FSTTCS.2009.2328

Author Details

Christof Löding

Karianto Wong

Questions / Remarks / Feedback

Feedback for Dagstuhl Publishing

Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail