Formal Languages, Automata and Numeration Systems 1
Home > Computing and Information Technology > Computer programming / software engineering > Programming and scripting languages: general > Formal Languages, Automata and Numeration Systems 1: Introduction to Combinatorics on Words
Formal Languages, Automata and Numeration Systems 1: Introduction to Combinatorics on Words

Formal Languages, Automata and Numeration Systems 1: Introduction to Combinatorics on Words


     0     
5
4
3
2
1



Available


X
About the Book

Formal Languages, Automaton and Numeration Systems presents readers with a review of research related to formal language theory, combinatorics on words or numeration systems, such as Words, DLT (Developments in Language Theory), ICALP, MFCS (Mathematical Foundation of Computer Science), Mons Theoretical Computer Science Days, Numeration, CANT (Combinatorics, Automata and Number Theory). Combinatorics on words deals with problems that can be stated in a non-commutative monoid, such as subword complexity of finite or infinite words, construction and properties of infinite words, unavoidable regularities or patterns.  When considering some numeration systems, any integer can be represented as a finite word over an alphabet of digits. This simple observation leads to the study of the relationship between the arithmetical properties of the integers and the syntactical properties of the corresponding representations. One of the most profound results in this direction is given by the celebrated theorem by Cobham. Surprisingly, a recent extension of this result to complex numbers led to the famous Four Exponentials Conjecture. This is just one example of the fruitful relationship between formal language theory (including the theory of automata) and number theory.

Table of Contents:
Foreword ix Introduction XIII Chapter 1. Words and Sequences From Scratch 1 1.1 Mathematical background and notation 2 1.1.1 About asymptotics 4 1.1.2 Algebraic number theory 5 1.2 Structures, words and languages 11 1.2.1 Distance and topology 16 1.2.2 Formal series 24 1.2.3 Language, factor and frequency 28 1.2.4 Period and factor complexity 33 1.3 Examples of infinite words 36 1.3.1 About cellular automata 43 1.3.2 Links with symbolic dynamical systems 46 1.3.3 Shift and orbit closure 59 1.3.4 First encounter with β-expansions 62 1.3.5 Continued fractions 69 1.3.6. Direct product, block coding and exercises .. 70 1.4 Bibliographic notes and comments 77 Chapter 2 Morphic Words 85 2.1 Formal definitions 89 2.2 Parikh vectors and matrices associated with a morphism 96 2.2.1 The matrix associated with a morphism 98 2.2.2 The tribonacci word 99 2.3 Constant-length morphisms 107 2.3.1 Closure properties 117 2.3.2 Kernel of a sequence 119 2.3.3 Connections with cellular automata 120 2.4 Primitive morphisms 122 2.4.1 Asymptotic behavior 127 2.4.2 Frequencies and occurrences of factors 127 2.5 Arbitrary morphisms 133 2.5.1 Irreducible matrices 134 2.5.2 Cyclic structure of irreducible matrices 144 2.5.3 Proof of theorem 2.35 150 2.6 Factor complexity and Sturmian words 153 2.7 Exercises 159 2.8 Bibliographic notes and comments 163 Chapter 3. More Material on Infinite Words 173 3.1 Getting rid of erasing morphisms 174 3.2 Recurrence 185 3.3 More examples of infinite words 191 3.4 Factor Graphs and special factors 202 3.4.1 de Bruijn graphs 202 3.4.2 Rauzy graphs 206 3.5 From the Thue–Morse word to pattern avoidance 219 3.6 Other combinatorial complexity measures 228 3.6.1 Abelian complexity 228 3.6.2 k-Abelian complexity 237 3.6.3 k-Binomial complexity 245 3.6.4 Arithmetical complexity 249 3.6.5 Pattern complexity 251 3.7 Bibliographic notes and comments 252 Bibliography 257 Index 295 Summary of Volume 2 303

About the Author :
Michel RIGO, Full professor, University of Liège, Department of Math., Belgium.

Review :
"This nice book is devoted to a quickly growing field, at the frontier between theoretical computer science, combinatorics, and number theory." (Zentralblatt MATH, 2016)


Best Sellers


Product Details
  • ISBN-13: 9781848216150
  • Publisher: ISTE Ltd and John Wiley & Sons Inc
  • Publisher Imprint: ISTE Ltd and John Wiley & Sons Inc
  • Height: 243 mm
  • No of Pages: 336
  • Returnable: N
  • Sub Title: Introduction to Combinatorics on Words
  • Width: 164 mm
  • ISBN-10: 1848216157
  • Publisher Date: 04 Nov 2014
  • Binding: Hardback
  • Language: English
  • Returnable: N
  • Spine Width: 25 mm
  • Weight: 635 gr


Similar Products

Add Photo
Add Photo

Customer Reviews

REVIEWS      0     
Click Here To Be The First to Review this Product
Formal Languages, Automata and Numeration Systems 1: Introduction to Combinatorics on Words
ISTE Ltd and John Wiley & Sons Inc -
Formal Languages, Automata and Numeration Systems 1: Introduction to Combinatorics on Words
Writing guidlines
We want to publish your review, so please:
  • keep your review on the product. Review's that defame author's character will be rejected.
  • Keep your review focused on the product.
  • Avoid writing about customer service. contact us instead if you have issue requiring immediate attention.
  • Refrain from mentioning competitors or the specific price you paid for the product.
  • Do not include any personally identifiable information, such as full names.

Formal Languages, Automata and Numeration Systems 1: Introduction to Combinatorics on Words

Required fields are marked with *

Review Title*
Review
    Add Photo Add up to 6 photos
    Would you recommend this product to a friend?
    Tag this Book Read more
    Does your review contain spoilers?
    What type of reader best describes you?
    I agree to the terms & conditions
    You may receive emails regarding this submission. Any emails will include the ability to opt-out of future communications.

    CUSTOMER RATINGS AND REVIEWS AND QUESTIONS AND ANSWERS TERMS OF USE

    These Terms of Use govern your conduct associated with the Customer Ratings and Reviews and/or Questions and Answers service offered by Bookswagon (the "CRR Service").


    By submitting any content to Bookswagon, you guarantee that:
    • You are the sole author and owner of the intellectual property rights in the content;
    • All "moral rights" that you may have in such content have been voluntarily waived by you;
    • All content that you post is accurate;
    • You are at least 13 years old;
    • Use of the content you supply does not violate these Terms of Use and will not cause injury to any person or entity.
    You further agree that you may not submit any content:
    • That is known by you to be false, inaccurate or misleading;
    • That infringes any third party's copyright, patent, trademark, trade secret or other proprietary rights or rights of publicity or privacy;
    • That violates any law, statute, ordinance or regulation (including, but not limited to, those governing, consumer protection, unfair competition, anti-discrimination or false advertising);
    • That is, or may reasonably be considered to be, defamatory, libelous, hateful, racially or religiously biased or offensive, unlawfully threatening or unlawfully harassing to any individual, partnership or corporation;
    • For which you were compensated or granted any consideration by any unapproved third party;
    • That includes any information that references other websites, addresses, email addresses, contact information or phone numbers;
    • That contains any computer viruses, worms or other potentially damaging computer programs or files.
    You agree to indemnify and hold Bookswagon (and its officers, directors, agents, subsidiaries, joint ventures, employees and third-party service providers, including but not limited to Bazaarvoice, Inc.), harmless from all claims, demands, and damages (actual and consequential) of every kind and nature, known and unknown including reasonable attorneys' fees, arising out of a breach of your representations and warranties set forth above, or your violation of any law or the rights of a third party.


    For any content that you submit, you grant Bookswagon a perpetual, irrevocable, royalty-free, transferable right and license to use, copy, modify, delete in its entirety, adapt, publish, translate, create derivative works from and/or sell, transfer, and/or distribute such content and/or incorporate such content into any form, medium or technology throughout the world without compensation to you. Additionally,  Bookswagon may transfer or share any personal information that you submit with its third-party service providers, including but not limited to Bazaarvoice, Inc. in accordance with  Privacy Policy


    All content that you submit may be used at Bookswagon's sole discretion. Bookswagon reserves the right to change, condense, withhold publication, remove or delete any content on Bookswagon's website that Bookswagon deems, in its sole discretion, to violate the content guidelines or any other provision of these Terms of Use.  Bookswagon does not guarantee that you will have any recourse through Bookswagon to edit or delete any content you have submitted. Ratings and written comments are generally posted within two to four business days. However, Bookswagon reserves the right to remove or to refuse to post any submission to the extent authorized by law. You acknowledge that you, not Bookswagon, are responsible for the contents of your submission. None of the content that you submit shall be subject to any obligation of confidence on the part of Bookswagon, its agents, subsidiaries, affiliates, partners or third party service providers (including but not limited to Bazaarvoice, Inc.)and their respective directors, officers and employees.

    Accept

    New Arrivals


    Inspired by your browsing history


    Your review has been submitted!

    You've already reviewed this product!