Repository landing page
research
The finiteness of a group generated by a 2-letter invertible-reversible Mealy automaton is decidable
Abstract
International audienceWe prove that a semigroup generated by a reversible two-state Mealy automaton is either finite or free of rank 2. This fact leads to the decidability of finiteness for groups generated by two-state or two-letter invertible-reversible Mealy automata and to the decidability of freeness for semigroups generated by two-state invertible-reversible Mealy automata- info:eu-repo/semantics/conferenceObject
- Conference papers
- Mealy automata
- automaton semigroups
- decidability of finiteness
- decidability of freeness
- Nerode equivalence
- ACM F.4.3
- [INFO.INFO-FL]Computer Science [cs]/Formal Languages and Automata Theory [cs.FL]
- [MATH.MATH-GR]Mathematics [math]/Group Theory [math.GR]