Programs over aperiodic monoids

DOI10.1016/0304-3975(89)90051-0zbMath0676.20043OpenAlexW2058707009MaRDI QIDQ1122664

Denis Thérien

Publication date: 1989

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

Full work available at URL: https://doi.org/10.1016/0304-3975(89)90051-0

zbMATH Keywords

complexitywordssemigroup varietiesprogramrecognizable languagesBoolean circuitalphabetfinite monoidaperiodic monoidcounting modulo puniversal monoids

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Varieties and pseudovarieties of semigroups (20M07) Free semigroups, generators and relations, word problems (20M05) Algebraic theory of languages and automata (68Q70) Semigroups in automata theory, linguistics, etc. (20M35)

Related Items (1)

Learning expressions and programs over monoids

Cites Work

• The dot-depth hierarchy of star-free languages is infinite
• Sur le produit de concatenation non ambigu
• A taxonomy of problems with fast parallel algorithms
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Programs over aperiodic monoids