The finite power property in free groups
โ Scribed by Flavio d'Alessandro; Jacques Sakarovitch
- Publisher
- Elsevier Science
- Year
- 2003
- Tongue
- English
- Weight
- 368 KB
- Volume
- 293
- Category
- Article
- ISSN
- 0304-3975
No coin nor oath required. For personal study only.
โฆ Synopsis
We show that the รฟnite power property is decidable for rational sets in the free group. The complexity of the construction involved in the decision procedure may be lowered to O(n 3 )where n is the cardinality of the state set of the automaton that deรฟnes the rational set.
Rร esumร e
La propriร etร e de puissance รฟnie est dร ecidable pour les parties rationnelles du groupe libre. La complexitร e de la construction utilisร ee par la procร edure de dร ecision peut รชtre ramenร ee ร a O(n 3 )-oร u n est le nombre d'ร etats de l'automate qui dร eรฟnit la partie rationnelle.
๐ SIMILAR VOLUMES
Using a probabilistic approach we establish a new residual property of free products of finite groups.
Let G be a finite group, and let Cay(G, S) be a Cayley digraph of G. If, for all T โ G, Cay(G, S) โผ = Cay(G, T ) implies S ฮฑ = T for some ฮฑ โ Aut(G), then Cay(G, S) is called a CI-graph of G. For a group G, if all Cayley digraphs of valency m are CI-graphs, then G is said to have the m-DCI property;
For a positive integer m, a group G is said to have the m-DCI property if, for any Cayley digraphs Cay(G, S) and Cay(G, T ) of G of valency m (that is, |S| = |T | =m), Cay(G, S)$Cay(G, T ) if and only if S \_ =T for some \_ # Aut(G). This paper is one of a series of papers towards characterizing fin