Completely Reachable Automata, Primitive Groups and the State Complexity of the Set of Synchronizing Words.

Stefan Hoffmann

Published in: LATA (2021)

Keyphrases

probability distribution
small number
knowledge base
higher level
finite automaton
learning algorithm
computational complexity
state space
co occurrence
decision problems
highly correlated
finite automata