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...
| מחבר ראשי: | |
|---|---|
| פורמט: | Article |
| שפה: | English |
| יצא לאור: |
Open Publishing Association
2011-08-01
|
| סדרה: | Electronic Proceedings in Theoretical Computer Science |
| גישה מקוונת: | http://arxiv.org/pdf/1108.3616v1 |