Pages that link to "Item:Q5261608"
From MaRDI portal
The following pages link to State Complexity of <i>k</i>-Union and <i>k</i>-Intersection for Prefix-Free Regular Languages (Q5261608):
Displaying 5 items.
- State complexity of union and intersection of star on \(k\) regular languages (Q418766) (← links)
- State complexity of union and intersection on graph-walking automata (Q2096590) (← links)
- A pumping lemma for regular closure of prefix-free languages (Q2105458) (← links)
- State Complexity of Union and Intersection for Two-way Nondeterministic Finite Automata (Q3100939) (← links)
- Operational State Complexity of Subtree-Free Regular Tree Languages (Q5298309) (← links)