×

zbMATH — the first resource for mathematics

Classification of finite monoids: the language approach. (English) Zbl 0471.20055

MSC:
20M35 Semigroups in automata theory, linguistics, etc.
68Q70 Algebraic theory of languages and automata
68Q45 Formal languages and automata
PDF BibTeX XML Cite
Full Text: DOI
References:
[1] Brzozowski, J.A.; Fich, F.E., Languages of R-trivial monoids, J. comput. system sci., 20, 32-49, (1980) · Zbl 0446.68066
[2] Eilenberg, S., Automata, languages, and machines, Vol. B, (1976), Academic Press New York
[3] Hall, M., The theory of groups, (1976), Chelsea New York
[4] Lallement, G., Semigroups and combinatorial applications, (1979), Wiley New York · Zbl 0421.20025
[5] Myhill, J., Finite automata and the representation of events, () · Zbl 0122.01102
[6] Schützenberger, M.P., On finite monoids having only trivial subgroups, Information and control, 8, 190-194, (1965) · Zbl 0131.02001
[7] Simon, I., Piecewise testable events, (), 214-222
[8] Straubing, H., Families of recognizable sets corresponding to certain varieties of finite monoids, J. pure appl. algebra, 15, 305-318, (1979) · Zbl 0414.20056
[9] Straubing, H., A generalization of the schützenberger product of finite monoids, Theoret. comput. sci., 13, 137-150, (1981) · Zbl 0456.20048
[10] Thérien, D., Classification of regular languages with congruences, (), Research Report CS-80-19
[11] Thérien, D., Languages of nilpotent and solvable groups, (), 616-632, Lecture Notes in Computer Science
[12] B. Tilson, Chapter XI and XII in [2].
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.