Page 1

Displaying 1 – 6 of 6

Showing per page

Fixed points of endomorphisms of certain free products

Pedro V. Silva (2012)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

The fixed point submonoid of an endomorphism of a free product of a free monoid and cyclic groups is proved to be rational using automata-theoretic techniques. Maslakova’s result on the computability of the fixed point subgroup of a free group automorphism is generalized to endomorphisms of free products of a free monoid and a free group which are automorphisms of the maximal subgroup.

Fixed points of endomorphisms of certain free products

Pedro V. Silva (2012)

RAIRO - Theoretical Informatics and Applications

The fixed point submonoid of an endomorphism of a free product of a free monoid and cyclic groups is proved to be rational using automata-theoretic techniques. Maslakova’s result on the computability of the fixed point subgroup of a free group automorphism is generalized to endomorphisms of free products of a free monoid and a free group which are automorphisms of the maximal subgroup.

Free group languages : rational versus recognizable

Pedro V. Silva (2004)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

We provide alternative proofs and algorithms for results proved by Sénizergues on rational and recognizable free group languages. We consider two different approaches to the basic problem of deciding recognizability for rational free group languages following two fully independent paths: the symmetrification method (using techniques inspired by the study of inverse automata and inverse monoids) and the right stabilizer method (a general approach generalizable to other classes of groups). Several...

Free group languages: Rational versus recognizable

Pedro V. Silva (2010)

RAIRO - Theoretical Informatics and Applications

We provide alternative proofs and algorithms for results proved by Sénizergues on rational and recognizable free group languages. We consider two different approaches to the basic problem of deciding recognizability for rational free group languages following two fully independent paths: the symmetrification method (using techniques inspired by the study of inverse automata and inverse monoids) and the right stabilizer method (a general approach generalizable to other classes of groups). Several...

Currently displaying 1 – 6 of 6

Page 1