Tree automata with global constraints
From MaRDI portal
Publication:3586405
DOI10.1142/S012905411000743XzbMATH Open1205.68199OpenAlexW1997436239MaRDI QIDQ3586405FDOQ3586405
Authors: Emmanuel Filiot, Jean-Marc Talbot, Sophie Tison 
Publication date: 6 September 2010
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s012905411000743x
Recommendations
- Tree Automata with Global Constraints
- On positive TAGED with a bounded number of constraints
- Decidable classes of tree automata mixing local and global constraints modulo flat theories
- Bottom-Up Tree Automata with Term Constraints
- The emptiness problem for tree automata with at least one global disequality constraint is NP-hard
Cites Work
- Automata for XML -- a survey
- Tree automata with one memory set constraints and cryptographic protocols
- Automata for reduction properties solving
- Closure properties and decision problems of dag automata
- Tree automata with equality constraints modulo equational theories
- Decidability of systems of set constraints with negative constraints
- TQL: a query language for semistructured data based on the ambient logic
- Marked PCP is decidable
Cited In (16)
- Projection for Büchi Tree Automata with Constraints between Siblings
- Emptiness and finiteness for tree automata with global reflexive disequality constraints
- Parameter reduction and automata evaluation for grammar-compressed trees
- Bottom-Up Tree Automata with Term Constraints
- Visibly Tree Automata with Memory and Constraints
- Tree Automata with Global Constraints
- Automated Induction with Constrained Tree Automata
- Tree automata, (dis-)equality constraints and term rewriting. What's new?
- Title not available (Why is that?)
- Equality and disequality constraints on direct subterms in tree automata
- Parameterized complexity of basic decision problems for tree automata
- The emptiness problem for tree automata with at least one global disequality constraint is NP-hard
- Title not available (Why is that?)
- The HOM problem is EXPTIME-complete
- On positive TAGED with a bounded number of constraints
- Decidable classes of tree automata mixing local and global constraints modulo flat theories
This page was built for publication: Tree automata with global constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3586405)
