Pages that link to "Item:Q347114"
From MaRDI portal
The following pages link to The complexity of intersecting finite automata having few final states (Q347114):
Displaying 6 items.
- The complexity of interacting automata (Q267110) (← links)
- Constrained synchronization and subset synchronization problems for weakly acyclic automata (Q832939) (← links)
- An intersection problem for finite automata (Q1118410) (← links)
- On the complexity of intersecting finite state automata and \(\mathcal{NL}\) versus \(\mathcal{NP}\) (Q1401330) (← links)
- The intersection problem for finite monoids (Q3304129) (← links)
- Decision problems for reversible and permutation automata (Q6666806) (← links)