The finiteness of a group generated by a 2-letter invertible-reversible Mealy automaton is decidable (Q2957911): Difference between revisions
From MaRDI portal
Changed an Item |
Changed label, description and/or aliases in en, and other parts |
||
| label / en | label / en | ||
The finiteness of a group generated by a 2-letter invertible-reversible Mealy automaton is decidable | |||
| Property / arXiv classification | |||
cs.FL | |||
| Property / arXiv classification: cs.FL / rank | |||
Normal rank | |||
| Property / arXiv classification | |||
math.GR | |||
| Property / arXiv classification: math.GR / rank | |||
Normal rank | |||
Revision as of 12:29, 19 April 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The finiteness of a group generated by a 2-letter invertible-reversible Mealy automaton is decidable |
scientific article |
Statements
30 January 2017
0 references
Mealy automata
0 references
automaton semigroups
0 references
decidability of finiteness
0 references
decidability of freeness
0 references
Nerode equivalence
0 references
cs.FL
0 references
math.GR
0 references
