Pages that link to "Item:Q2909101"
From MaRDI portal
The following pages link to COMPLEXITY IN UNION-FREE REGULAR LANGUAGES (Q2909101):
Displayed 7 items.
- On a structural property in the state complexity of projected regular languages (Q443744) (← links)
- Nondeterministic complexity in subclasses of convex languages (Q2319915) (← links)
- Nondeterministic complexity of operations on free and convex languages (Q2399254) (← links)
- Nondeterministic Complexity of Operations on Closed and Ideal Languages (Q2830213) (← links)
- State Complexity of <i>k</i>-Union and <i>k</i>-Intersection for Prefix-Free Regular Languages (Q5261608) (← links)
- Descriptional Complexity of the Forever Operator (Q5384434) (← links)
- Languages, Decidability, and Complexity (Q5496920) (← links)