On the Finiteness Problem for Automaton (Semi)groups

Details On the Finiteness Problem for Automaton (Semi)groups On the Finiteness Problem for Automaton (Semi)groups

2011-05-24

arxiv.org/abs/1105.4725v1

Computer Science

Formal Languages and Automata Theory

Scientific paper

This paper addresses a decision problem highlighted by Grigorchuk, Nekrashevich, and Sushchanskii, namely the finiteness problem for automaton (semi)groups. For semigroups, we give an effective sufficient but not necessary condition for finiteness and, for groups, an effective necessary but not sufficient condition. The efficiency of the new criteria is demonstrated by testing all Mealy automata with small stateset and alphabet. Finally, for groups, we provide a necessary and sufficient condition that does not directly lead to a decision procedure.

Affiliated with

Also associated with

No associations

Rating

On the Finiteness Problem for Automaton (Semi)groups does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On the Finiteness Problem for Automaton (Semi)groups, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the Finiteness Problem for Automaton (Semi)groups will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-515710