A semigroup approach to automaticity

DOI10.1007/S00026-003-0180-4MaRDI QIDQ1407498zbMATH OpenOpenAlexFDO

Authors D. Massart

Publication date 16 September 2003

Published in Annals of Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00026-003-0180-4

zbMATH Keywords

automatic sequencesfinite automatasemigroup actions

Mathematics Subject Classification ID

Automata sequences (11B85) Actions of groups and semigroups; invariant theory (associative rings and algebras) (16W22) Formal languages and automata (68Q45) Combinatorics on words (68R15)

Review text

The authors study a nice natural concept of ``automaticity based on semigroup actions. This generalizes essentially all classical notions such as \(k\)-automaticity and \(k\)-regularity. In particular, the classical properties of \(k\)-automatic sequences [\textit{A. Cobham}, Math. Syst. Theory 6, 164--192 (1972; Zbl 0253.02029)] still hold.

Recommendations

• Notions of automaticity in semigroups.
• A note on automatic semigroups.
• Semi-groupes fortement automatiques.
• The problem on automaticity of semigroups of regular languages.
• Automatic semigroups

Cited in

(6)

• A generalization of automatic sequences
• Automatic semigroups
• Automatic presentations and semigroup constructions
• Automaticity of one-relator semigroups with length less than or equal to three
• Semi-groupes fortement automatiques.
• Automatic semigroups producing an automaton semigroup

This page was built for publication: A semigroup approach to automaticity

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