Pages that link to "Item:Q5168427"
From MaRDI portal
The following pages link to THE RANGES OF STATE COMPLEXITIES FOR COMPLEMENT, STAR, AND REVERSAL OF REGULAR LANGUAGES (Q5168427):
Displaying 9 items.
- On the state complexity of reversals of regular languages (Q596099) (← links)
- Operational complexity and right linear grammars (Q2041682) (← links)
- Operational complexity and pumping lemmas (Q2170280) (← links)
- On the State and Computational Complexity of the Reverse of Acyclic Minimal DFAs (Q2914712) (← links)
- Kleene closure and state complexity (Q2956884) (← links)
- The Average State Complexity of the Star of a Finite Set of Words Is Linear (Q3533005) (← links)
- Implementation and Application of Automata (Q5463977) (← links)
- Complexity of automatic sequences (Q5918530) (← links)
- Further Remarks on the Operational Nonterminal Complexity (Q6114830) (← links)