Formal Languages, Automata and Numeration Systems 1 Introduction to Combinatorics on Words
Saved in:
| Main Author | |
|---|---|
| Format | eBook |
| Language | English |
| Published |
Newark
John Wiley & Sons, Incorporated
2014
|
| Edition | 1 |
| Subjects | |
| Online Access | Get full text |
Cover
| Author | Rigo, Michel |
|---|---|
| Author_xml | – sequence: 1 fullname: Rigo, Michel |
| BookMark | eNotzr1OwzAUQGEjAaItfQdvLETytR3_jCVqKVIEA1XX6ia5qSoSG2Jn4O1Bgulsn86SXYcY6IotAcAL4STIW7ZwXngH1oo7tk7p0ghlwJTGywVTuziNOPAaw3nGM6VHvplzHDEjx9Dx13mkCfMlBv7-nTKNicM9u-lxSLT-74odd9tDtS_qt-eXalMXCMo5XaAA7BVY0VHpSkl903Sm1ehtqQBa3Tr63ZLWEopSeOolNhJRd8Yap1uhVuzhD_6c4tdMKZ-oifGjpZAnHE7bpwqs06CN-gFCFkVh |
| ContentType | eBook |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Computer Science |
| EISBN | 1119008212 9781119008217 |
| Edition | 1 |
| ExternalDocumentID | EBC1784146 |
| GroupedDBID | AABBV ABARN ABQPQ ACLGV ADVEM AERYV AFOJC AHWGJ AJFER ALMA_UNASSIGNED_HOLDINGS AMYDA BBABE GEOUK |
| ID | FETCH-LOGICAL-a13884-a01af3170de5852efbbd6c4a975311c4c8e981277ea0509ef2ab2aa4d67684c03 |
| IngestDate | Wed Oct 29 01:44:20 EDT 2025 |
| IsPeerReviewed | false |
| IsScholarly | false |
| LCCallNum_Ident | QA76.6 .R546 2014 |
| Language | English |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-a13884-a01af3170de5852efbbd6c4a975311c4c8e981277ea0509ef2ab2aa4d67684c03 |
| OCLC | 890981770 |
| PQID | EBC1784146 |
| PageCount | 338 |
| ParticipantIDs | proquest_ebookcentral_EBC1784146 |
| PublicationCentury | 2000 |
| PublicationDate | 2014 |
| PublicationDateYYYYMMDD | 2014-01-01 |
| PublicationDate_xml | – year: 2014 text: 2014 |
| PublicationDecade | 2010 |
| PublicationPlace | Newark |
| PublicationPlace_xml | – name: Newark |
| PublicationYear | 2014 |
| Publisher | John Wiley & Sons, Incorporated |
| Publisher_xml | – name: John Wiley & Sons, Incorporated |
| SSID | ssib036165692 |
| Score | 1.9075056 |
| SourceID | proquest |
| SourceType | Publisher |
| SubjectTerms | Computer programming Formal languages Machine theory |
| Subtitle | Introduction to Combinatorics on Words |
| TableOfContents | 3.6. Other combinatorial complexity measures -- 3.6.1. Abelian complexity -- 3.6.2. k-Abelian complexity -- 3.6.3. k-Binomial complexity -- 3.6.4. Arithmetical complexity -- 3.6.5. Pattern complexity -- 3.7. Bibliographic notes and comments -- Bibliography -- Index -- Volume 2 - Contents -- Volume 2 - Index Cover page -- Half-Title page -- Title page -- Copyright page -- Contents -- Foreword -- Introduction -- I.1. What this book is or is not about -- I.2. A few words about what you will find -- I.3. How to read this book -- I.4. Acknowledgments -- 1: Words and Sequences from Scratch -- 1.1. Mathematical background and notation -- 1.1.1. About asymptotics -- 1.1.2. Algebraic number theory -- 1.2. Structures, words and languages -- 1.2.1. Distance and topology -- 1.2.2. Formal series -- 1.2.3. Language, factor and frequency -- 1.2.4. Period and factor complexity -- 1.3. Examples of infinite words -- 1.3.1. About cellular automata -- 1.3.2. Links with symbolic dynamical systems -- 1.3.3. Shift and orbit closure -- 1.3.4. First encounter with β-expansions -- 1.3.5. Continued fractions -- 1.3.6. Direct product, block coding and exercises -- 1.4. Bibliographic notes and comments -- 2: Morphic Words -- 2.1. Formal definitions -- 2.2. Parikh vectors and matrices associated with a morphism -- 2.2.1. The matrix associated with a morphism -- 2.2.2. The tribonacci word -- 2.3. Constant-length morphisms -- 2.3.1. Closure properties -- 2.3.2. Kernel of a sequence -- 2.3.3. Connections with cellular automata -- 2.4. Primitive morphisms -- 2.4.1. Asymptotic behavior -- 2.4.2. Frequencies and occurrences of factors -- 2.5. Arbitrary morphisms -- 2.5.1. Irreducible matrices -- 2.5.2. Cyclic structure of irreducible matrices -- 2.5.3. Proof of theorem 2.35 -- 2.6. Factor complexity and Sturmian words -- 2.7. Exercises -- 2.8. Bibliographic notes and comments -- 3: More Material on Infinite Words -- 3.1. Getting rid of erasing morphisms -- 3.2. Recurrence -- 3.3. More examples of infinite words -- 3.4. Factor Graphs and special factors -- 3.4.1. de Bruijn graphs -- 3.4.2. Rauzy graphs -- 3.5. From the Thue-Morse word to pattern avoidance |
| Title | Formal Languages, Automata and Numeration Systems 1 |
| URI | https://ebookcentral.proquest.com/lib/[SITE_ID]/detail.action?docID=1784146 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV07T8MwELagXZh4i7c80KkYxc7VSVdKqwqJDqigbpXt2IiBFlC68Os5J04iKiQEi5VYUaR8F93Dd98dIZfORYkG22MJSMcglRlToC2zGG2J1OBvnXly8v1Ejh_hbtabNSO4CnZJrq_N54-8kv9IFfdQrp4l-wfJ1i_FDbxG-eKKEsZ1zfmtb-uBmq_FCXR52FhOFF7lS3Q_C45Vd-JplaVsQ0_ybo3tw8vzsqqYDwXzIeznsBb2_1BXE5RKaIBcU6PKSBFVWt-b-5IoudZiengz4D7_CLITj97emZ_J5XPXnfi2BG2TtAWgb9UibbSWw_o8JJa-eU-RRv5uyArrPN0hbespG7tkwy72yHY1qIIGvbVP4hIvWuN1RSu0KKJFG7RoQIvyA_I0Gk4HYxamRTDF4zQFpiKuHLpDUWYxBhLWaZ1JA8pThzk3YFLbR3cmSazyTW-sE0oLpSCTPhlpoviQtBbLhT0iVEGsMFRzUoMCRE5HJnUQKdHLjEh1dkxo9b3zIqkdKmnnDZInvz9ySrYayZ6RVv6xsufo4uT6IuD8BalZAS0 |
| linkProvider | ProQuest Ebooks |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=book&rft.title=Formal+Languages%2C+Automata+and+Numeration+Systems+1&rft.au=Rigo%2C+Michel&rft.date=2014-01-01&rft.pub=John+Wiley+%26+Sons%2C+Incorporated&rft.isbn=9781119008217&rft.externalDocID=EBC1784146 |