Pages that link to "Item:Q2271457"
From MaRDI portal
The following pages link to Determination of finite automata accepting subregular languages (Q2271457):
Displaying 6 items.
- State complexity of combined operations with two basic operations (Q441851) (← links)
- Nondeterministic state complexity of star-free languages (Q442152) (← links)
- On external contextual grammars with subregular selection languages (Q443738) (← links)
- On a structural property in the state complexity of projected regular languages (Q443744) (← links)
- Incomplete operational transition complexity of regular languages (Q498392) (← links)
- On the descriptional complexity of stateless deterministic ordered restarting automata (Q1706159) (← links)
