Pages that link to "Item:Q1763716"
From MaRDI portal
The following pages link to State complexity of some operations on binary regular languages (Q1763716):
Displaying 14 items.
- State complexity of star of union and square of union on \textit{k} regular languages (Q391180) (← links)
- Size complexity of rotating and sweeping automata (Q414916) (← links)
- State complexity of union and intersection of star on \(k\) regular languages (Q418766) (← links)
- State complexity of the concatenation of regular tree languages (Q418803) (← links)
- State complexity of combined operations with two basic operations (Q441851) (← links)
- Nondeterministic state complexity of star-free languages (Q442152) (← links)
- Descriptional complexity of unambiguous input-driven pushdown automata (Q484313) (← links)
- Incomplete operational transition complexity of regular languages (Q498392) (← links)
- Limitations of lower bound methods for deterministic nested word automata (Q553328) (← links)
- Concatenation of regular languages and descriptional complexity (Q639851) (← links)
- State complexity of union and intersection of square and reversal on \(k\) regular languages (Q714820) (← links)
- The state complexity of \(L^{2}\) and \(L^k\) (Q844206) (← links)
- Succinct description of regular languages by weak restarting automata (Q948085) (← links)
- On NFAs where all states are final, initial, or both (Q1034621) (← links)
