Pages that link to "Item:Q3538853"
From MaRDI portal
The following pages link to DETERMINISTIC BLOW-UPS OF MINIMAL NONDETERMINISTIC FINITE AUTOMATA OVER A FIXED ALPHABET (Q3538853):
Displayed 8 items.
- On a structural property in the state complexity of projected regular languages (Q443744) (← links)
- Minimisation of automata (Q2074212) (← links)
- Descriptional complexity of regular languages (Q2074214) (← links)
- THE MAGIC NUMBER PROBLEM FOR SUBREGULAR LANGUAGE FAMILIES (Q2909186) (← links)
- Concatenation of Regular Languages and Descriptional Complexity (Q3392955) (← links)
- THE RANGES OF STATE COMPLEXITIES FOR COMPLEMENT, STAR, AND REVERSAL OF REGULAR LANGUAGES (Q5168427) (← links)
- State Complexity of Projected Languages (Q5200092) (← links)
- Operational Accepting State Complexity: The Unary and Finite Case (Q5205038) (← links)