Repository landing page

We are not able to resolve this OAI Identifier to the repository landing page. If you are the repository manager for this record, please head to the Dashboard and adjust the settings.
research
oaioai:drops-oai.dagstuhl.de:3960

The finiteness of a group generated by a 2-letter invertible-reversible Mealy automaton is decidable

Authors
Publication date
1 January 2013
Publisher
LIPIcs - Leibniz International Proceedings in Informatics. 30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013)
Doi

    Abstract

    We 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

    Similar works

    Full text

    thumbnail-image

    Dagstuhl Research Online Publication Server

    redirect
    oaioai:drops-oai.dagstuhl.de:3960
    Last time updated on 17/11/2016

    This paper was published in Dagstuhl Research Online Publication Server.

    Having an issue?

    Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.