Pages that link to "Item:Q5463977"
From MaRDI portal
The following pages link to Implementation and Application of Automata (Q5463977):
Displaying 13 items.
- Concatenation of regular languages and descriptional complexity (Q639851) (← links)
- A new technique for reachability of states in concatenation automata (Q777990) (← links)
- The state complexity of \(L^{2}\) and \(L^k\) (Q844206) (← links)
- State complexity of basic operations on suffix-free regular languages (Q1029324) (← links)
- State complexity of some operations on binary regular languages (Q1763716) (← links)
- State complexity of regular languages (Q2731279) (← links)
- The Complexity of Languages Resulting from the Concatenation Operation (Q2829979) (← links)
- Undecidability of state complexity (Q2855756) (← links)
- Concatenation of Regular Languages and Descriptional Complexity (Q3392955) (← links)
- State Complexity of Combined Operations for Prefix-Free Regular Languages (Q3618598) (← links)
- The complexity of concatenation on deterministic and alternating finite automata (Q5223613) (← links)
- (Q5313800) (← links)
- State complexity of deletion and bipolar deletion (Q5963404) (← links)