The finiteness of a group generated by a 2-letter invertible-reversible Mealy automaton is decidable (Q2957911): Difference between revisions
From MaRDI portal
Changed label, description and/or aliases in en, and other parts |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.4230/LIPIcs.STACS.2013.502 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.4230/LIPICS.STACS.2013.502 / rank | |||
Normal rank | |||
Latest revision as of 06:30, 20 December 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
