Cargando…
Formal languages, automata and numeration systems. 1, Introduction to combinatorics on words /
Annotation
| Clasificación: | Libro Electrónico |
|---|---|
| Autor principal: | |
| Formato: | Electrónico eBook |
| Idioma: | Inglés |
| Publicado: |
London :
Wiley,
2014.
|
| Colección: | Networks and telecommunications series.
|
| Temas: | |
| Acceso en línea: | Texto completo |
MARC
| LEADER | 00000cam a2200000 i 4500 | ||
|---|---|---|---|
| 001 | EBOOKCENTRAL_ocn890798347 | ||
| 003 | OCoLC | ||
| 005 | 20240329122006.0 | ||
| 006 | m o d | ||
| 007 | cr cnu---unuuu | ||
| 008 | 140918s2014 enk ob 001 0 eng d | ||
| 040 | |a N$T |b eng |e rda |e pn |c N$T |d DG1 |d YDXCP |d OH1 |d OCLCQ |d VRC |d CHVBK |d OCLCF |d S4S |d EBLCP |d RECBK |d DEBSZ |d OCLCQ |d DEBBG |d DG1 |d LIP |d ZCU |d MERUC |d OCLCQ |d TEF |d OCLCQ |d INT |d AU@ |d VT2 |d OCLCQ |d U3W |d OCLCQ |d DKC |d OCLCQ |d HS0 |d OCLCO |d OCLCQ |d OCLCO |d OCLCL | ||
| 066 | |c (S | ||
| 019 | |a 890981770 |a 892984534 | ||
| 020 | |a 9781119008217 |q (electronic bk.) | ||
| 020 | |a 1119008212 |q (electronic bk.) | ||
| 020 | |a 9781119008200 |q (electronic bk.) | ||
| 020 | |a 1119008204 |q (electronic bk.) | ||
| 020 | |a 9781119042853 | ||
| 020 | |a 1119042852 | ||
| 020 | |z 9781848216150 | ||
| 020 | |z 1848216157 | ||
| 024 | 7 | |a 10.1002/9781119008200 |2 doi | |
| 029 | 1 | |a AU@ |b 000053548472 | |
| 029 | 1 | |a CHBIS |b 010259827 | |
| 029 | 1 | |a CHBIS |b 010346039 | |
| 029 | 1 | |a CHNEW |b 000943550 | |
| 029 | 1 | |a CHVBK |b 330765663 | |
| 029 | 1 | |a CHVBK |b 480237751 | |
| 029 | 1 | |a DEBBG |b BV043648147 | |
| 029 | 1 | |a DEBSZ |b 431774102 | |
| 029 | 1 | |a DEBSZ |b 468874550 | |
| 029 | 1 | |a GBVCP |b 814874975 | |
| 029 | 1 | |a NZ1 |b 15909348 | |
| 035 | |a (OCoLC)890798347 |z (OCoLC)890981770 |z (OCoLC)892984534 | ||
| 050 | 4 | |a QA267 | |
| 072 | 7 | |a COM |x 051010 |2 bisacsh | |
| 082 | 0 | 4 | |a 005.13/1 |2 23 |
| 049 | |a UAMI | ||
| 100 | 1 | |a Rigo, Michel. | |
| 245 | 1 | 0 | |a Formal languages, automata and numeration systems. |n 1, |p Introduction to combinatorics on words / |c Michel Rigo. |
| 246 | 3 | 0 | |a Introduction to combinatorics on words |
| 264 | 1 | |a London : |b Wiley, |c 2014. | |
| 300 | |a 1 online resource | ||
| 336 | |a text |b txt |2 rdacontent | ||
| 337 | |a computer |b c |2 rdamedia | ||
| 338 | |a online resource |b cr |2 rdacarrier | ||
| 490 | 1 | |a Networks and telecommunications series | |
| 500 | |a Title from PDF title page (viewed on September 18, 2014). | ||
| 504 | |a Includes bibliographical references and index. | ||
| 520 | 8 | |a Annotation |b 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. Contents to include: - algebraic structures, homomorphisms, relations, free monoid - finite words, prefixes, suffixes, factors, palindromes- periodicity and Fine-Wilf theorem- infinite words are sequences over a finite alphabet- properties of an ultrametric distance, example of the p-adic norm- topology of the set of infinite words- converging sequences of infinite and finite words, compactness argument- iterated morphism, coding, substitutive or morphic words- the typical example of the Thue-Morse word- the Fibonacci word, the Mex operator, the n-bonacci words- wordscomingfromnumbertheory(baseexpansions, continuedfractions ...) - the taxonomy of Lindenmayer systems- S-adic sequences, Kolakoski word- repetition in words, avoiding repetition, repetition threshold- (complete) de Bruijn graphs- concepts from computability theory and decidability issues- Post correspondence problem and application to mortality of matrices- origins of combinatorics on words- bibliographic notes- languages of finite words, regular languages- factorial, prefix/suffix closed languages, trees and codes- unambiguous and deterministic automata, Kleene's theorem- growth function of regular languages- non-deterministic automata and determinization- radix order, first word of each length and decimation of a regular language- the theory of the minimal automata- an introduction to algebraic automata theory, the syntactic monoid and thesyntactic complexity- star-free languages and a theorem of Schu tzenberger- rational formal series and weighted automata- context-free languages, pushdown automata and grammars- growth function of context-free languages, Parikh's theorem- some decidable and undecidable problems in formal language theory- bibliographic notes- factor complexity, Morse-Hedlund theorem- arithmetic complexity, Van Der Waerden theorem, pattern complexity - recurrence, uniform recurrence, return words- Sturmian words, coding of rotations, Kronecker's theorem- frequencies of letters, factors and primitive morphism- critical exponent- factor complexity of automatic sequences- factor complexity of purely morphic sequences- primitive words, conjugacy, Lyndon word- abelianisation and abelian complexity- bibliographic notes- automatic sequences, equivalent definitions- a theorem of Cobham, equivalence of automatic sequences with constantlength morphic sequences- a few examples of well-known automatic sequences- about Derksen's theorem- some morphic sequences are not automatic- abstract numeration system and S-automatic sequences- k - -automatic sequences- bibliographic notes- numeration systems, greedy algorithm- positional numeration systems, recognizable sets of integers- divisi. | |
| 505 | 0 | 0 | |6 880-01 |g Vol. 1 |t Introduction to combinatorics on words. |
| 505 | 0 | 0 | |g Vol. 2 |t Applications to recognizability and decidability. |
| 590 | |a ProQuest Ebook Central |b Ebook Central Academic Complete | ||
| 650 | 0 | |a Machine theory. | |
| 650 | 0 | |a Formal languages. | |
| 650 | 0 | |a Computer programming. | |
| 650 | 6 | |a Théorie des automates. | |
| 650 | 6 | |a Langages formels. | |
| 650 | 6 | |a Programmation (Informatique) | |
| 650 | 7 | |a computer programming. |2 aat | |
| 650 | 7 | |a COMPUTERS |x Programming Languages |x General. |2 bisacsh | |
| 650 | 7 | |a Computer programming |2 fast | |
| 650 | 7 | |a Formal languages |2 fast | |
| 650 | 7 | |a Machine theory |2 fast | |
| 758 | |i has work: |a 1 Formal languages, automata and numeration systems Introduction to combinatorics on words (Text) |1 https://id.oclc.org/worldcat/entity/E39PCG6gKDJ9VV8gGVDQhHgRDm |4 https://id.oclc.org/worldcat/ontology/hasWork | ||
| 776 | 0 | 8 | |i Print version: |a Rigo, Michel. |t Formal Languages, Automata and Numeration Systems. |d Hoboken : Wiley, ©2014 |z 9781848216150 |
| 830 | 0 | |a Networks and telecommunications series. | |
| 856 | 4 | 0 | |u https://ebookcentral.uam.elogim.com/lib/uam-ebooks/detail.action?docID=1784146 |z Texto completo |
| 880 | 0 | 0 | |6 505-01/(S |g Machine generated contents note: |g 1.1. |t Mathematical background and notation -- |g 1.1.1. |t About asymptotics -- |g 1.1.2. |t Algebraic number theory -- |g 1.2. |t Structures, words and languages -- |g 1.2.1. |t Distance and topology -- |g 1.2.2. |t Formal series -- |g 1.2.3. |t Language, factor and frequency -- |g 1.2.4. |t Period and factor complexity -- |g 1.3. |t Examples of infinite words -- |g 1.3.1. |t About cellular automata -- |g 1.3.2. |t Links with symbolic dynamical systems -- |g 1.3.3. |t Shift and orbit closure -- |g 1.3.4. |t First encounter with β-expansions -- |g 1.3.5. |t Continued fractions -- |g 1.3.6. |t Direct product, block coding and exercises -- |g 1.4. |t Bibliographic notes and comments -- |g 2.1. |t Formal definitions -- |g 2.2. |t Parikh vectors and matrices associated with a morphism -- |g 2.2.1. |t matrix associated with a morphism -- |g 2.2.2. |t tribonacci word -- |g 2.3. |t Constant-length morphisms -- |g 2.3.1. |t Closure properties -- |g 2.3.2. |t Kernel of a sequence -- |g 2.3.3. |t Connections with cellular automata -- |g 2.4. |t Primitive morphisms -- |g 2.4.1. |t Asymptotic behavior -- |g 2.4.2. |t Frequencies and occurrences of factors -- |g 2.5. |t Arbitrary morphisms -- |g 2.5.1. |t Irreducible matrices -- |g 2.5.2. |t Cyclic structure of irreducible matrices -- |g 2.5.3. |t Proof of theorem 2.35 -- |g 2.6. |t Factor complexity and Sturmian words -- |g 2.7. |t Exercises -- |g 2.8. |t Bibliographic notes and comments -- |g 3.1. |t Getting rid of erasing morphisms -- |g 3.2. |t Recurrence -- |g 3.3. |t More examples of infinite words -- |g 3.4. |t Factor Graphs and special factors -- |g 3.4.1. |t de Bruijn graphs -- |g 3.4.2. |t Rauzy graphs -- |g 3.5. |t From the Thue-Morse word to pattern avoidance -- |g 3.6. |t Other combinatorial complexity measures -- |g 3.6.1. |t Abelian complexity -- |g 3.6.2. |t k-Abelian complexity -- |g 3.6.3. |t k-Binomial complexity -- |g 3.6.4. |t Arithmetical complexity -- |g 3.6.5. |t Pattern complexity -- |g 3.7. |t Bibliographic notes and comments. |
| 938 | |a EBL - Ebook Library |b EBLB |n EBL1784146 | ||
| 938 | |a EBSCOhost |b EBSC |n 846052 | ||
| 938 | |a Recorded Books, LLC |b RECE |n rbeEB00591255 | ||
| 938 | |a YBP Library Services |b YANK |n 12075826 | ||
| 938 | |a YBP Library Services |b YANK |n 12081253 | ||
| 938 | |a YBP Library Services |b YANK |n 12677956 | ||
| 994 | |a 92 |b IZTAP | ||