Tree automata
From MaRDI portal
Recommendations
Cited in
(26)- Alternating tree automata
- On a representation of tree automata
- Finite tree automata with cost functions
- Multitree automata that count
- Automata on finite trees
- Z-automata for compact and direct representation of unranked tree languages
- Variable tree automata over infinite ranked alphabets
- scientific article; zbMATH DE number 3854429 (Why is no real title available?)
- Visibly Tree Automata with Memory and Constraints
- Construction of Tree Automata from Regular Expressions
- Arbology: Trees and Pushdown Automata
- Rigid Tree Automata
- Nested Sibling Tree Automata
- scientific article; zbMATH DE number 1051240 (Why is no real title available?)
- Loops and overloops for tree-walking automata
- scientific article; zbMATH DE number 1494251 (Why is no real title available?)
- Symbolic tree automata
- Basics on tree automata
- Bottom-Up Tree Automata with Term Constraints
- scientific article; zbMATH DE number 7362732 (Why is no real title available?)
- scientific article; zbMATH DE number 7444022 (Why is no real title available?)
- Branching Pushdown Tree Automata
- Restarting Tree Automata
- Term Rewriting and Applications
- Tree homomorphisms for unranked trees
- Complementing deterministic tree-walking automata
This page was built for publication: Tree automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5418248)