Families of recognizable sets corresponding to certain varieties of finite monoids

DOI10.1016/0022-4049(79)90024-0zbMath0414.20056OpenAlexW2034979418MaRDI QIDQ599182

Howard Straubing

Publication date: 1979

Published in: Journal of Pure and Applied Algebra (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0022-4049(79)90024-0

zbMATH Keywords

free monoidsyntactic monoidsrecognizable setvariety of finite monoids

Mathematics Subject Classification ID

Varieties and pseudovarieties of semigroups (20M07) Algebraic theory of languages and automata (68Q70) Semigroups in automata theory, linguistics, etc. (20M35)

Related Items (33)

On varieties of rational languages and variable length codes. II ⋮ Vectorial languages and linear temporal logic ⋮ An extension of the wreath product principle for finite Mazurkiewicz traces ⋮ On uniformity within \(NC^ 1\) ⋮ SOLVABLE MONOIDS WITH COMMUTING IDEMPOTENTS ⋮ The half-levels of the \(\mathrm {FO}_2\) alternation hierarchy ⋮ Unnamed Item ⋮ Characterizing classes of regular languages using prefix codes of bounded synchronization delay ⋮ On the relative solvability of certain inverse monoids. ⋮ Sur le produit avec compteur modulo un nombre premier ⋮ Finite semigroups, feedback, and the Letichevsky criteria on non-empty words in finite automata. ⋮ Classification of finite monoids: the language approach ⋮ On varieties of rational languages and variable-length codes ⋮ Products of languages with counter ⋮ Recognizable languages and congruences ⋮ Topologies for the free monoid ⋮ Counting monoids and rational languages ⋮ Algebraic and topological theory of languages ⋮ Circuit complexity of regular languages ⋮ Regular languages in \(NC\) ⋮ Theme and Variations on the Concatenation Product ⋮ Closure of varieties of languages under products with counter ⋮ Circuit complexity of regular languages ⋮ Actions, wreath products of \(\mathcal C\)-varieties and concatenation product. ⋮ Finite semigroup varieties of the form V*D ⋮ Aperiodic homomorphisms and the concatenation product of recognizable sets ⋮ Varieties ⋮ Sur les monoides dont tous les groupes sont resolubles ⋮ The generalized Szendrei expansion of an \(\mathcal R\)-unipotent semigroup. ⋮ Languages and formations generated by \(D_4\) and \(Q_8\) ⋮ A language theoretic interpretation of the Schützenberger representations with applications to certain varieties of languages ⋮ Algebraic tools for the concatenation product. ⋮ Non-uniform automata over groups

Cites Work

• On finite monoids having only trivial subgroups
• A Note on Star-Free Events
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Families of recognizable sets corresponding to certain varieties of finite monoids