Two-state Mealy automata of intermediate growth over a two-letter alphabet (Q1810168): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 10:19, 1 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Two-state Mealy automata of intermediate growth over a two-letter alphabet |
scientific article |
Statements
Two-state Mealy automata of intermediate growth over a two-letter alphabet (English)
0 references
15 June 2003
0 references
Examples of constructions of semigroups of intermediate growth have been described by transformations defined by Mealy automata. These constructions have led to the problem of constructing Mealy automata to show the existence of new semigroups of intermediate growth. As a result, automata with \(m\) states over an \(n\)-letter alphabet have been constructed for \(m\geq 2\), \(n\geq 3\) or \(m\geq 3\), \(n\geq 2\) that define semigroups of intermediate growth. In this paper, the authors construct such automata for the case \(m=2\), \(n=2\).
0 references
intermediate growth of semigroups
0 references
Mealy automata
0 references
growth functions
0 references
word problem
0 references
generators
0 references