Infinite permutations vs. infinite words
I am going to compare well-known properties of infinite words with those of infinite permutations, a new object studied since middle 2000s. Basically, it was Sergey Avgustinovich who invented this notion, although in an early study by Davis et al. permutations appear in a very similar framework as e...
Main Author: | Anna E. Frid |
---|---|
Format: | Article |
Language: | English |
Published: |
Open Publishing Association
2011-08-01
|
Series: | Electronic Proceedings in Theoretical Computer Science |
Online Access: | http://arxiv.org/pdf/1108.3616v1 |
Similar Items
-
On infinite permutations
by: Dmitri G. Fon-Der-Flaass, et al.
Published: (2005-01-01) -
HOMOGENEITY OF INFINITE PERMUTATION-GROUPS
by: Neumann, P
Published: (1988) -
Infinite bounded permutation groups
by: Adeleke, SA, et al.
Published: (1996) -
Infinite and Bi-infinite Words with Decidable Monadic Theories
by: Dietrich Kuske, et al.
Published: (2018-08-01) -
Subdegree growth rates of infinite primitive permutation groups
by: Smith, S, et al.
Published: (2005)