Displaying similar documents to “Monoid presentations of groups by finite special string-rewriting systems”

Monoid presentations of groups by finite special string-rewriting systems

Duncan W. Parkes, V. Yu. Shavrukov, Richard M. Thomas (2010)

RAIRO - Theoretical Informatics and Applications

Similarity:

We show that the class of groups which have monoid presentations by means of finite special [λ]-confluent string-rewriting systems strictly contains the class of plain groups (the groups which are free products of a finitely generated free group and finitely many finite groups), and that any group which has an infinite cyclic central subgroup can be presented by such a string-rewriting system if and only if it is the direct product of an infinite cyclic group and a finite cyclic group. ...

Periodicity problem of substitutions over ternary alphabets

Bo Tan, Zhi-Ying Wen (2008)

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

Similarity:

In this paper, we characterize the substitutions over a three-letter alphabet which generate a ultimately periodic sequence.

Circular splicing and regularity

Paola Bonizzoni, Clelia De Felice, Giancarlo Mauri, Rosalba Zizza (2004)

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

Similarity:

Circular splicing has been very recently introduced to model a specific recombinant behaviour of circular DNA, continuing the investigation initiated with linear splicing. In this paper we restrict our study to the relationship between regular circular languages and languages generated by finite circular splicing systems and provide some results towards a characterization of the intersection between these two classes. We consider the class of languages X * , called here star languages,...