Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2011
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/1104.3314 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Table of Contents:
- Let $A \ \times \ B$ be the direct product of a strongly connected permutation automaton $A$ and a strongly connected synchronizing (reset) automaton $B$, then $A \ \times \ B$ is strongly connected and $$\boldsymbol{A \cong (A \times B)/π}$$ $$\boldsymbol{B \cong (A \times B)/ρ}$$ $$\boldsymbol{(A \times B) \ \cong \ (A \times B)/π\ \times \ (A \times B)/ρ}$$ where $π$ and $ρ$ are automaton congruence relations defined in this paper, $(A \times B)/π$ and $(A \times B)/ρ$ are quotient automata constructed by $π$ and $ρ$ respectively.