International Journal of Algebra and Computation · 1998 · 23 citations · 5 references
ComputingComputer ScienceMathematicsCombinatoricsSet TheorySyntaxAutomata TheoryFinite AutomataRegular LanguagesAutomata On WordsCongruence RelationsFinite Automata TheoryRegular ExpressionsRegular Language RecognitionRegular SetsSemigroup TheoryStructural Properties Of Languages
For a given integer n, we define ω n -semigroups as a generalization of ω-semigroups for languages of words of length less than ω n+1 . When they are finite, those algebraic structures define the same sets as those recognized by Choueka automata. These sets are also equivalent to regular expressions in which an unary ω operator standing for the infinite repetition of a language is as free as the Kleene closure operator is. Naturally, the notion of syntactic congruence still works on ω n -semigroups: among all ω n -semigroups recognizing a regular language X, there exists an unique ω n -semigroup of which all others are refinements.
5
On finite monoids having only trivial subgroups
M. P. Schützenberger · Information and Control · 1965 · 621 citations
Nicolas Bédon · Theoretical Computer Science · 1996 · 37 citations