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