Rigid Tree Automata
From MaRDI portal
Recommendations
- Rigid tree automata and applications
- scientific article; zbMATH DE number 3854429
- Tree automata
- Regulated tree automata
- Automata on finite trees
- Tree-stack automata
- scientific article; zbMATH DE number 4213435
- scientific article; zbMATH DE number 54244
- An Automata Theoretic Approach to Rational Tree Relations
- scientific article; zbMATH DE number 1615227
Cites work
- Automata for reduction properties solving
- Closure properties and decision problems of dag automata
- Haskell overloading is DEXPTIME-complete
- scientific article; zbMATH DE number 1614701 (Why is no real title available?)
- Mobile values, new names, and secure communication
- Rigid tree automata and applications
- Satisfiability of a Spatial Logic with Tree Variables
- Term Rewriting and Applications
- Tree automata with equality constraints modulo equational theories
- Tree Automata with Global Constraints
- Tree Automata with Memory, Visibility and Structural Constraints
- Tree automata with one memory set constraints and cryptographic protocols
- Visibly pushdown languages
- Visibly Pushdown Languages and Term Rewriting
Cited in
(8)- Inductive theorem proving based on tree grammars
- Parameterized complexity of basic decision problems for tree automata
- Tree automata, (dis-)equality constraints and term rewriting. What's new?
- Algorithmic introduction of quantified cuts
- scientific article; zbMATH DE number 2043549 (Why is no real title available?)
- scientific article; zbMATH DE number 2040904 (Why is no real title available?)
- Compressibility of Finite Languages by Grammars
- Rigid tree automata and applications
This page was built for publication: Rigid Tree Automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3618602)
