On Direct Product and Quotient of Strongly Connected Automata
Abstract
Let A \ × \ B be the direct product of a strongly connected permutation automaton A and a strongly connected synchronizing (reset) automaton B, then A \ × \ B is strongly connected and A (A × B)/π B (A × B)/ (A × B) \ \ (A × B)/π \ × \ (A × B)/ where π and are automaton congruence relations defined in this paper, (A × B)/π and (A × B)/ are quotient automata constructed by π and respectively.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.