Kopsavilkums
The complexity of infinite words is considered from the point of view of a transformation with a Mealy machine that is the simplest model of a finite automaton transducer. We are mostly interested in algebraic properties of the underlying partially ordered set. Results considered with the existence of supremum, infimum, antichains, chains and density aspects are investigated.
| Oriģinālvaloda | Angļu |
|---|---|
| Lapas (no-līdz) | 451-466 |
| Lapu skaits | 16 |
| Žurnāls | RAIRO - Theoretical Informatics and Applications |
| Sējums | 42 |
| Izdevuma numurs | 3 |
| DOIs | |
| Publikācijas statuss | Publicēts - 2008 |
Nospiedums
Uzziniet vairāk par pētniecības tēmām “Some algebraic properties of machine poset of infinite words”. Kopā tie veido unikālu nospiedumu.Citēt šo
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver