The problem on automaticity of semigroups of regular languages.

MaRDI QIDQ3599583zbMATH OpenFDO

Authors E. E. Khazova

Publication date 4 February 2009

zbMATH Keywords

automatic semigroupsone-letter alphabetsregular 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)

Recommendations

• A note on automatic semigroups.
• An automatic semigroup of languages
• A note on finitely generated semigroups of regular languages.
• On the structure of finitely generated semigroups of unary regular languages
• Automatic semigroups

Cited in

(11)

• A semigroup approach to automaticity
• A note on automatic semigroups.
• An automatic semigroup of languages
• Uniform decision problems for automatic semigroups.
• On the structure of finitely generated semigroups of unary regular languages
• On the semigroup languages and the regular languages
• scientific article; zbMATH DE number 1259068 (Why is no real title available?)
• scientific article; zbMATH DE number 1529076 (Why is no real title available?)
• A note on finitely generated semigroups of regular languages.
• scientific article; zbMATH DE number 2211803 (Why is no real title available?)
• Large aperiodic semigroups

This page was built for publication: The problem on automaticity of semigroups of regular languages.

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