The finiteness of a group generated by a 2-letter invertible-reversible Mealy automaton is decidable (Q2957911)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6678946
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The finiteness of a group generated by a 2-letter invertible-reversible Mealy automaton is decidable |
scientific article; zbMATH DE number 6678946 |
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
0.874471127986908
0 references
0.8424890041351318
0 references
0.8282189965248108
0 references
0.8256567120552063
0 references
