State complexity of the concatenation of regular tree languages
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 941396 (Why is no real title available?)
- scientific article; zbMATH DE number 7315100 (Why is no real title available?)
- scientific article; zbMATH DE number 3353192 (Why is no real title available?)
- A Second Course in Formal Languages and Automata Theory
- Adding nesting structure to words
- Automata for XML -- a survey
- Decimations of languages and state complexity
- Descriptional and computational complexity of finite automata -- a survey
- Estimation of state complexity of combined operations
- On the minimization of XML schemas and tree automata for unranked trees
- Operational state complexity of nested word automata
- State complexity of Kleene-star operations on trees
- State complexity of basic language operations combined with reversal
- State complexity of operations on input-driven pushdown automata
- State complexity of some operations on binary regular languages
- State trade-offs in unranked tree automata
- The state complexities of some basic operations on regular languages
- Tight Bounds on the Descriptional Complexity of Regular Expressions
- Transformations between different models of unranked bottom-up tree automata
- Transition complexity of incomplete DFAs
- Typechecking for XML transformers
- Undecidability of the state complexity of composed regular operations
Cited in
(14)- State complexity of SBTA languages
- Implementation and Application of Automata
- Operational accepting state complexity: the unary and finite case
- State complexity of projection and quotient on unranked trees
- On state complexity of finite word and tree languages
- State complexity of Kleene-star operations on trees
- State complexity of subtree-free regular tree languages
- State complexity of \(k\)-parallel tree concatenation
- State complexity of regular tree languages for tree matching
- State complexity of regular tree languages for tree pattern matching
- Operational state complexity of subtree-free regular tree languages
- The complexity of concatenation on deterministic and alternating finite automata
- Concatenation of Regular Languages and Descriptional Complexity
- State complexity of Kleene-star operations on regular tree languages
This page was built for publication: State complexity of the concatenation of regular tree languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q418803)
