Pages that link to "Item:Q2271462"
From MaRDI portal
The following pages link to Estimation of state complexity of combined operations (Q2271462):
Displayed 20 items.
- State complexity of star of union and square of union on \textit{k} regular languages (Q391180) (← links)
- State complexity of union and intersection of star on \(k\) regular languages (Q418766) (← links)
- State complexity of the concatenation of regular tree languages (Q418803) (← links)
- State complexity of combined operations with two basic operations (Q441851) (← links)
- State complexity of union and intersection of square and reversal on \(k\) regular languages (Q714820) (← links)
- Lower bounds for the size of deterministic unranked tree automata (Q714828) (← links)
- State complexity of inversion operations (Q896671) (← links)
- Primitivity, uniform minimality, and state complexity of Boolean operations (Q2322701) (← links)
- State complexity of combined operations involving catenation and binary Boolean operations: beyond the Brzozowski conjectures (Q2333820) (← links)
- Undecidability of state complexity (Q2855756) (← links)
- State Complexity of Regular Tree Languages for Tree Matching (Q2974061) (← links)
- State Complexity of Catenation Combined with Union and Intersection (Q3073626) (← links)
- Undecidability of State Complexities Using Mirror Images (Q3166954) (← links)
- STATE COMPLEXITY OF TWO COMBINED OPERATIONS: CATENATION-UNION AND CATENATION-INTERSECTION (Q3224949) (← links)
- State Complexity of Boundary of Prefix-Free Regular Languages (Q3455750) (← links)
- STATE COMPLEXITY AND APPROXIMATION (Q4902894) (← links)
- State Complexity of Four Combined Operations Composed of Union, Intersection, Star and Reversal (Q5200089) (← links)
- State Complexity of <i>k</i>-Union and <i>k</i>-Intersection for Prefix-Free Regular Languages (Q5261608) (← links)
- Operational State Complexity of Subtree-Free Regular Tree Languages (Q5298309) (← links)
- Operational state complexity revisited: the contribution of monsters and modifiers (Q6175083) (← links)