State complexity of regular tree languages for tree matching
From MaRDI portal
Recommendations
- State complexity of regular tree languages for tree pattern matching
- State complexity of subtree-free regular tree languages
- Operational state complexity of subtree-free regular tree languages
- State complexity of the concatenation of regular tree languages
- State complexity of k-parallel tree concatenation
Cites work
- Estimation of state complexity of combined operations
- Minimal Ascending and Descending Tree Automata
- On the Bounds for State-Set Size in the Proofs of Equivalence Between Deterministic, Nondeterministic, and Two-Way Finite Automata
- On the minimization of XML schemas and tree automata for unranked trees
- ON THE STATE COMPLEXITY OF COMBINED OPERATIONS AND THEIR ESTIMATION
- Pattern Matching in Trees
- State complexity of combined operations
- State complexity of star of union and square of union on \textit{k} regular languages
- State complexity of the concatenation of regular tree languages
- State complexity of union and intersection of square and reversal on \(k\) regular languages
- The state complexities of some basic operations on regular languages
Cited in
(9)- State complexity of single-word pattern matching in regular languages
- Regular matching and inclusion on compressed tree patterns with constrained context variables
- State complexity of subtree-free regular tree languages
- Regular matching problems for infinite trees
- Operational state complexity of subtree-free regular tree languages
- State complexity of regular tree languages for tree pattern matching
- Largest common prefix of a regular tree language
- Algebras of generalized tree languages with fixed variables
- Query learning of regular tree languages: How to avoid dead states
This page was built for publication: State complexity of regular tree languages for tree matching
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2974061)
