Rigid Tree Automata
From MaRDI portal
Publication:3618602
DOI10.1007/978-3-642-00982-2_38zbMath1234.68213OpenAlexW1927487601MaRDI QIDQ3618602
Florent Jacquemard, Francis Klay, Camille Vacher
Publication date: 2 April 2009
Published in: Language and Automata Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://hal.inria.fr/inria-00579001/file/RTA.pdf
Related Items (4)
Algorithmic introduction of quantified cuts ⋮ Compressibility of Finite Languages by Grammars ⋮ Parameterized complexity of basic decision problems for tree automata ⋮ Inductive theorem proving based on tree grammars
Cites Work
- Unnamed Item
- Rigid tree automata and applications
- Closure properties and decision problems of dag automata
- Haskell overloading is DEXPTIME-complete
- Tree automata with one memory set constraints and cryptographic protocols
- Automata for reduction properties solving
- Tree automata with equality constraints modulo equational theories
- Visibly Pushdown Languages and Term Rewriting
- Tree Automata with Global Constraints
- Visibly pushdown languages
- Satisfiability of a Spatial Logic with Tree Variables
- Mobile values, new names, and secure communication
- Term Rewriting and Applications
- Tree Automata with Memory, Visibility and Structural Constraints
This page was built for publication: Rigid Tree Automata
