What people are saying - Write a review
We haven't found any reviews in the usual places.
Semigroups languages and automata
Structure of finite semigroups
4 other sections not shown
Other editions - View all
0-simple algorithm aperiodic boolean algebra calculation Chapter commutative conditions are equivalent congruence contains an idempotent Conversely Corollary deduce defined definition denote Eilenberg element equations example factor finite alphabet finite monoid finite semigroup formula free monoids free semigroup Green's relations hierarchy if-class implies inverse isomorphic J. E. Pin languages corresponding length less letter locally testable locally trivial minimal automaton minimal ideal nilpotent non-empty notation operation prefix code Problem Proof Let Proposition 1.6 quotient rational languages recognizable languages recognized regular class relational morphism S. W. Margolis Schutzenberger Semigroup Forum semigroups or monoids sequential function Show simple semigroup star-free languages Straubing submonoid subsemigroup subset subword Suppose surjective morphism syntactic monoid syntactic semigroup transition monoid trivial monoids V-morphism variety closed variety of languages variety of monoids variety of semigroups whence wreath product