On Direct Product and Quotient of Strongly Connected Automata
Formal Languages and Automata Theory
2024-05-07 v9 Group Theory
Abstract
Let be the direct product of a strongly connected permutation automaton and a strongly connected synchronizing (reset) automaton , then is strongly connected and where and are automaton congruence relations defined in this paper, and are quotient automata constructed by and 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