Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

39

FSTTCS
2009
Springer

favoriteEmaildiscussreport

102views Software Engineering» more FSTTCS 2009»

On Nondeterministic Unranked Tree Automata with Sibling Constraints

14 years 5 months ago

On Nondeterministic Unranked Tree Automata with Sibling Constraints

Download www.automata.rwth-aachen.de

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.

Christof Löding, Karianto Wong

Real-time Traffic

Emptiness Problem | FSTTCS 2009 | Nondeterministic Automata | Theoretical Computer Science | Unranked Tree Automata |

claim paper

Related Content

» ForwardXPath and extended register automata on datatrees

» A Direct Translation from XPath to Nondeterministic Automata

» Unranked Tree Automata with Sibling Equalities and Disequalities

» The Emptiness Problem for Tree Automata with Global Constraints

» Deterministic Automata on Unranked Trees

» Languages Modulo Normalization

» Alternationfree modal mucalculus for data trees

» Bounded repairability for regular tree languages

» Parameter Reduction in GrammarCompressed Trees

Post Info
More Details (n/a)

Added	26 May 2010
Updated	26 May 2010
Type	Conference
Year	2009
Where	FSTTCS
Authors	Christof Löding, Karianto Wong

Comments (0)