State complexity of Kleene-star operations on trees
From MaRDI portal
Publication:2891328
Recommendations
- State complexity of Kleene-star operations on regular tree languages
- State complexity of the concatenation of regular tree languages
- State complexity of \(k\)-parallel tree concatenation
- The state complexities of some basic operations on regular languages
- scientific article; zbMATH DE number 7315100
Cites work
- scientific article; zbMATH DE number 1747444 (Why is no real title available?)
- scientific article; zbMATH DE number 941396 (Why is no real title available?)
- A Second Course in Formal Languages and Automata Theory
- Automata for XML -- a survey
- Descriptional and computational complexity of finite automata -- a survey
- Finite state complexity
- Fundamentals of Computation Theory
- General varieties of tree languages
- Nondeterminism is essential in small 2FAs with few reversals
- On the State Complexity of Operations on Two-Way Finite Automata
- On the minimization of XML schemas and tree automata for unranked trees
- Regular expressions: new results and open problems
- State complexity of combined operations
- State complexity of four combined operations composed of union, intersection, star and reversal
- State complexity of power
- State trade-offs in unranked tree automata
- State-size hierarchy for finite-state complexity
- 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
- Undecidability of the state complexity of composed regular operations
Cited in
(4)
This page was built for publication: State complexity of Kleene-star operations on trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2891328)
