Pages that link to "Item:Q596099"
From MaRDI portal
The following pages link to On the state complexity of reversals of regular languages (Q596099):
Displayed 9 items.
- State complexity of basic language operations combined with reversal (Q948089) (← links)
- State complexity of basic operations on suffix-free regular languages (Q1029324) (← links)
- Operational state complexity of nested word automata (Q2271464) (← links)
- Magic numbers in the state hierarchy of finite automata (Q2461796) (← links)
- Concatenation of Regular Languages and Descriptional Complexity (Q3392955) (← links)
- NONDETERMINISTIC FINITE AUTOMATA — RECENT RESULTS ON THE DESCRIPTIONAL AND COMPUTATIONAL COMPLEXITY (Q3395129) (← links)
- State complexity of cyclic shift (Q3515466) (← links)
- Nondeterministic Finite Automata—Recent Results on the Descriptional and Computational Complexity (Q3602795) (← links)
- State Complexity of Combined Operations for Prefix-Free Regular Languages (Q3618598) (← links)