Computer Science – Formal Languages and Automata Theory
Scientific paper
2011-04-17
Computer Science
Formal Languages and Automata Theory
6 pages
Scientific paper
An automaton is isomorphic to the direct product of a permutation strongly connected automaton and a synchronizing strongly connected automaton if and only if all of these three conditions are met: (i) it is strongly connected; (ii) the minimal ideal of its input semigroup has a single R-class and (iii) the ranges of the idempotent elements of the minimal ideal of its input semigroup form a partition on its set of states.
No associations
LandOfFree
On Direct Product and Quotient of Strongly Connected Automata does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with On Direct Product and Quotient of Strongly Connected Automata, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On Direct Product and Quotient of Strongly Connected Automata will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-394329