English

On Direct Product and Quotient of Strongly Connected Automata

Formal Languages and Automata Theory 2024-05-07 v9 Group Theory

Abstract

Let A × BA \ \times \ B be the direct product of a strongly connected permutation automaton AA and a strongly connected synchronizing (reset) automaton BB, then A × BA \ \times \ B is strongly connected and A(A×B)/π\boldsymbol{A \cong (A \times B)/\pi} B(A×B)/ρ\boldsymbol{B \cong (A \times B)/\rho} (A×B)  (A×B)/π × (A×B)/ρ\boldsymbol{(A \times B) \ \cong \ (A \times B)/\pi \ \times \ (A \times B)/\rho} where π\pi and ρ\rho are automaton congruence relations defined in this paper, (A×B)/π(A \times B)/\pi and (A×B)/ρ(A \times B)/\rho are quotient automata constructed by π\pi and ρ\rho respectively.

Keywords

Cite

@article{arxiv.1104.3314,
  title  = {On Direct Product and Quotient of Strongly Connected Automata},
  author = {Zino H. Hu},
  journal= {arXiv preprint arXiv:1104.3314},
  year   = {2024}
}

Comments

Major revision