Operational state complexity of subtree-free regular tree languages
From MaRDI portal
Recommendations
Cites work
- Estimation of state complexity of combined operations
- ON THE STATE COMPLEXITY OF COMBINED OPERATIONS AND THEIR ESTIMATION
- State Complexity of k-Union and k-Intersection for Prefix-Free Regular Languages
- State complexity of basic operations on suffix-free regular languages
- State complexity of combined operations
- State complexity of combined operations for suffix-free regular languages
- STATE COMPLEXITY OF CONCATENATION AND COMPLEMENTATION
- State complexity of power
- 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 FINITE 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
- The state complexity of \(L^{2}\) and \(L^k\)
- UNARY LANGUAGE OPERATIONS, STATE COMPLEXITY AND JACOBSTHAL'S FUNCTION
Cited in
(7)- State complexity of subtree-free regular tree languages
- State complexity of regular tree languages for tree matching
- State complexity of projection and quotient on unranked trees
- State complexity of the concatenation of regular tree languages
- scientific article; zbMATH DE number 7315100 (Why is no real title available?)
- Bounded repairability for regular tree languages
- State complexity of regular tree languages for tree pattern matching
This page was built for publication: Operational state complexity of subtree-free regular tree languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5298309)
