scientific article

zbMath0572.20052MaRDI QIDQ3689383

Denis Thérien

Publication date: 1983

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

free monoidlanguages recognized by finite nilpotent groups

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Semigroups in automata theory, linguistics, etc. (20M35)

Related Items

Partially ordered finite monoids and a theorem of I. Simon ⋮ The complexity of the equation solvability problem over nilpotent groups ⋮ Products of languages with counter ⋮ Counting monoids and rational languages ⋮ Closure of varieties of languages under products with counter ⋮ The pseudovariety of semigroups of triangular matrices over a finite field ⋮ Languages and formations generated by \(D_4\) and \(Q_8\) ⋮ Non-uniform automata over groups