Pages that link to "Item:Q391180"
From MaRDI portal
The following pages link to State complexity of star of union and square of union on \textit{k} regular languages (Q391180):
Displaying 7 items.
- State complexity of union and intersection of star on \(k\) regular languages (Q418766) (← links)
- On the state complexity of star of union and star of intersection (Q2895795) (← links)
- State Complexity of Regular Tree Languages for Tree Matching (Q2974061) (← links)
- The Average State Complexity of the Star of a Finite Set of Words Is Linear (Q3533005) (← 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)
- State complexity of deletion and bipolar deletion (Q5963404) (← links)
