Pages that link to "Item:Q3811719"
From MaRDI portal
The following pages link to The complexity of computing the automorphism group of automata and related problems (Q3811719):
Displaying 6 items.
- Polynomial-time algorithms for testing strong isomorphism and computing the automorphism group of \(R\)-strongly connected automata (Q1184982) (← links)
- Automata and complexity. Essays presented to Eric Goles on the occasion of his 70th birthday (Q2073680) (← links)
- Completely reachable automata, primitive groups and the state complexity of the set of synchronizing words (Q2232291) (← links)
- (Q4725756) (← links)
- An effective lower bound for group complexity of finite semigroups and automata (Q5389413) (← links)
- (Q5554979) (← links)