Congruences Associated with Dol-Schemes
From MaRDI portal
Publication:3789785
DOI10.2307/2047310zbMath0646.20046OpenAlexW4213361285MaRDI QIDQ3789785
Gabriel Thierrin, Mario Petrich
Publication date: 1988
Full work available at URL: https://doi.org/10.2307/2047310
formal languagesshuffle productfinite alphabetprincipal congruenceDOL schemehypercodeperfect congruencecongruences on finitely generated free monoidsconvex regular languageuniquely perfect
Formal languages and automata (68Q45) Free semigroups, generators and relations, word problems (20M05) Semigroups in automata theory, linguistics, etc. (20M35) Grammars and rewriting systems (68Q42) Mappings of semigroups (20M15)
Related Items (2)
Characterizations of Linear Congruences on a Free Monoid ⋮ Malcev products of weakly cancellative monoids and varieties of bands.
Cites Work
This page was built for publication: Congruences Associated with Dol-Schemes