Classification of finite monoids: the language approach

DOI10.1016/0304-3975(81)90057-8zbMath0471.20055MaRDI QIDQ1157412

Denis Thérien

Publication date: 1981

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(81)90057-8

zbMATH Keywords

*-variety of languages; variety of monoids; *-variety of congruences; hierarchies of monoids

Mathematics Subject Classification ID

68Q45: Formal languages and automata

68Q70: Algebraic theory of languages and automata

20M35: Semigroups in automata theory, linguistics, etc.

Related Items

Unnamed Item, On Shuffle Ideals, The pseudovariety of semigroups of triangular matrices over a finite field, Imre Simon: an exceptional graduate student, The Power of Diversity, Circuit complexity of regular languages, Descriptional and computational complexity of finite automata -- a survey, \(NC^ 1\): The automata-theoretic viewpoint, On semidirect products of two finite semilattices, Non-uniform automata over groups, Products of languages with counter, Semigroups and languages of dot-depth two, Partially ordered finite monoids and a theorem of I. Simon, Closure of varieties of languages under products with counter, Polynomial closure and unambiguous product, Algebraic tools for the concatenation product., Languages defined with modular counting quantifiers, Some complexity results for polynomial rational expressions., Finite semigroup varieties of the form V*D, Machines that can output empty words, Languages of dot-depth 3/2, Theme and Variations on the Concatenation Product, A conjecture on the concatenation product, Efficiency of automata in semi-commutation verification techniques, A SURVEY ON SMALL FRAGMENTS OF FIRST-ORDER LOGIC OVER FINITE WORDS, Descriptional and Computational Complexity of Finite Automata, Varieties of finite categories, Sur le produit avec compteur modulo un nombre premier

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Families of recognizable sets corresponding to certain varieties of finite monoids
• Languages of R-trivial monoids
• A generalization of the Schützenberger product of finite monoids
• On finite monoids having only trivial subgroups
• The Invalidity of Markoff's Schema