Green’s Relations in Deterministic Finite Automata
Sign Up to like & getrecommendations! Published in 2018 at "Theory of Computing Systems"
DOI: 10.1007/s00224-018-9847-4
Abstract: Green’s relations are a fundamental tool in the structure theory of semigroups. They can be defined by reachability in the (right/left/two-sided) Cayley graph. The equivalence classes of Green’s relations then correspond to the strongly connected… read more here.
Keywords: green relations; finite automata; relations deterministic; deterministic finite ... See more keywords
Congruences on abundant semigroups associated with Green’s *-relations
Sign Up to like & getrecommendations! Published in 2017 at "Periodica Mathematica Hungarica"
DOI: 10.1007/s10998-016-0163-y
Abstract: Good congruences are defined as congruences preserving $$\mathcal L^*$$L∗-classes and $$\mathcal R^*$$R∗-classes. In this paper the good congruences on abundant semigroups generated by Green’s $$*$$∗-relations are investigated. The related results for regular semigroups are enriched… read more here.
Keywords: semigroups associated; abundant semigroups; associated green; green relations ... See more keywords
Green's relations and regularity on some subsemigroups of transformations that preserve equivalences
Sign Up to like & getrecommendations! Published in 2018 at "Turkish Journal of Mathematics"
DOI: 10.3906/mat-1805-50
Abstract: Let $T(X)$ be the full transformation semigroup on a set $X$. For two equivalence relations $E$ and $F$ on $X$ with $F \subseteq E$, let read more here.
Keywords: subsemigroups transformations; transformations preserve; preserve equivalences; green relations ... See more keywords