Pages that link to "Item:Q5223613"
From MaRDI portal
The following pages link to The complexity of concatenation on deterministic and alternating finite automata (Q5223613):
Displaying 10 items.
- Concatenation of regular languages and descriptional complexity (Q639851) (← links)
- A new technique for reachability of states in concatenation automata (Q777990) (← links)
- Concatenation operations and restricted variants of two-dimensional automata (Q831799) (← links)
- Alternation in two-way finite automata (Q2029487) (← links)
- The Complexity of Languages Resulting from the Concatenation Operation (Q2829979) (← links)
- Concatenation of Regular Languages and Descriptional Complexity (Q3392955) (← links)
- The complexity of languages resulting from the concatenation operation (Q4609330) (← links)
- The State Complexity of Alternating Automata (Q5145316) (← links)
- (Q5186755) (← links)
- Operations on Boolean and Alternating Finite Automata (Q6204121) (← links)