Measuring cones and other thick subsets in free groups
In this paper we investigate the special automata over finite rank free groups and estimate asymptotic characteristics of sets they accept. We show how one can decompose an arbitrary regular subset of a finite rank free group into disjoint union of sets accepted by special automata or special mono...
Main Authors: | Elizaveta Frenkel, Vladimir Remeslennikov |
---|---|
Format: | Article |
Language: | English |
Published: |
University of Isfahan
2018-12-01
|
Series: | International Journal of Group Theory |
Subjects: | |
Online Access: | http://ijgt.ui.ac.ir/article_21479_33235e249efcf4f459180ac8cdea5176.pdf |
Similar Items
-
Syntactic Complexities of Nine Subclasses of Regular Languages
by: Li, Baiyu
Published: (2012) -
Syntactic Complexities of Nine Subclasses of Regular Languages
by: Li, Baiyu
Published: (2012) -
On residually finite semigroups of cellullar automata
by: Tullio Ceccherini-Silberstein, et al.
Published: (2015-06-01) -
On $GPW$-Flat Acts
by: Hamideh Rashidi, et al.
Published: (2020-01-01) -
Comultiplication on monoids
by: Martin Arkowitz, et al.
Published: (1997-01-01)