A note on finitely generated semigroups of regular languages.

MaRDI QIDQ5429962zbMATH OpenFDO

Authors Sergey Afonin, Elena Khazova

Publication date 5 December 2007

zbMATH Keywords

automatic semigroupsfinitely generated semigroupsmembership problemregular languages

Mathematics Subject Classification ID

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

Recommendations

• The problem on automaticity of semigroups of regular languages.
• On the structure of finitely generated semigroups of unary regular languages
• An automatic semigroup of languages
• A note on automatic semigroups.
• On the semigroup languages and the regular languages

Cited in

(10)

• Remarks concerning finitely generated semigroups having regular sets of unique normal forms
• On the structure of finitely generated semigroups of unary regular languages
• scientific article; zbMATH DE number 988805 (Why is no real title available?)
• On the semigroup languages and the regular languages
• The problem on automaticity of semigroups of regular languages.
• Finitely generated semigroups having presentation with regular congruence classes.
• scientific article; zbMATH DE number 1259068 (Why is no real title available?)
• scientific article; zbMATH DE number 701113 (Why is no real title available?)
• scientific article; zbMATH DE number 1944132 (Why is no real title available?)
• The View Selection Problem for Regular Path Queries

This page was built for publication: A note on finitely generated semigroups of regular languages.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5429962)