Pages that link to "Item:Q443743"
From MaRDI portal
The following pages link to Reversal of binary regular languages (Q443743):
Displayed 11 items.
- State complexity of combined operations for suffix-free regular languages (Q392179) (← links)
- State complexity of inversion operations (Q896671) (← links)
- Prefix-free languages: left and right quotient and reversal (Q896681) (← links)
- Power, positive closure, and quotients on convex languages (Q2029485) (← links)
- Self-Verifying Finite Automata and Descriptional Complexity (Q2829967) (← links)
- Most Complex Non-Returning Regular Languages (Q5205037) (← links)
- State Complexity of <i>k</i>-Union and <i>k</i>-Intersection for Prefix-Free Regular Languages (Q5261608) (← links)
- The Ranges of Accepting State Complexities of Languages Resulting from Some Operations (Q5859667) (← links)
- Operational complexity: NFA-to-DFA trade-off (Q6175089) (← links)
- Operational complexity in subregular classes (Q6199871) (← links)
- Operations on Boolean and Alternating Finite Automata (Q6204121) (← links)