Cargando…

Formal languages, automata and numeration systems. 2, Applications to recognizability and decidability /

The interplay between words, computability, algebra and arithmetic has now proved its relevance and fruitfulness. Indeed, the cross-fertilization between formal logic and finite automata (such as that initiated by J.R. Büchi) or between combinatorics on words and number theory has paved the way to...

Descripción completa

Detalles Bibliográficos
Clasificación:Libro Electrónico
Autor principal: Rigo, Michel (Autor)
Formato: Electrónico eBook
Idioma:Inglés
Publicado: London : Hoboken, NJ : ISTE Ltd ; John Wiley & Sons, Inc., 2014.
Colección:Networks and telecommunications series.
Temas:
Acceso en línea:Texto completo

MARC

LEADER 00000cam a2200000 i 4500
001 EBOOKCENTRAL_ocn898157454
003 OCoLC
005 20240329122006.0
006 m o d
007 cr |n|||||||||
008 141215s2014 enk ob 001 0 eng d
040 |a YDXCP  |b eng  |e rda  |e pn  |c YDXCP  |d OCLCO  |d OCLCQ  |d OCLCF  |d EBLCP  |d RECBK  |d DEBSZ  |d E7B  |d N$T  |d VRC  |d OH1  |d OCLCQ  |d LOA  |d OCLCQ  |d MOR  |d PIFAG  |d ZCU  |d MERUC  |d OCLCQ  |d TEF  |d GZM  |d UPM  |d I9W  |d ICG  |d VTS  |d INT  |d AU@  |d OCLCQ  |d U3W  |d OCLCQ  |d DKC  |d OCLCQ  |d UKAHL  |d OCLCQ  |d TUHNV  |d OCLCO  |d OCLCQ  |d OCLCO 
066 |c (S 
019 |a 892800066  |a 892984535  |a 893685417  |a 904419725  |a 904529128  |a 906119973  |a 906232834  |a 922282742  |a 937763507  |a 945769644  |a 960202737  |a 988509483  |a 992108331  |a 1013916200  |a 1058138278 
020 |a 9781119042952  |q (electronic bk.) 
020 |a 111904295X  |q (electronic bk.) 
020 |a 9781119042853  |q (electronic bk.) 
020 |a 1119042852  |q (electronic bk.) 
020 |z 9781848217881  |q (hardback) 
020 |z 1848217889  |q (hardback) 
020 |z 9781848216150 
029 1 |a CHNEW  |b 000700152 
029 1 |a CHNEW  |b 000700153 
029 1 |a CHNEW  |b 000700154 
029 1 |a CHNEW  |b 000700155 
029 1 |a CHNEW  |b 000888804 
029 1 |a DEBBG  |b BV044070356 
029 1 |a DEBSZ  |b 425891445 
029 1 |a DEBSZ  |b 431774145 
029 1 |a DEBSZ  |b 449449890 
029 1 |a GBVCP  |b 1014965489 
029 1 |a AU@  |b 000056054186 
035 |a (OCoLC)898157454  |z (OCoLC)892800066  |z (OCoLC)892984535  |z (OCoLC)893685417  |z (OCoLC)904419725  |z (OCoLC)904529128  |z (OCoLC)906119973  |z (OCoLC)906232834  |z (OCoLC)922282742  |z (OCoLC)937763507  |z (OCoLC)945769644  |z (OCoLC)960202737  |z (OCoLC)988509483  |z (OCoLC)992108331  |z (OCoLC)1013916200  |z (OCoLC)1058138278 
050 4 |a QA267  |b .R54 2014eb 
072 7 |a REF  |x 018000  |2 bisacsh 
082 0 4 |a 005.13/1  |2 23 
049 |a UAMI 
100 1 |a Rigo, Michel,  |e author. 
245 1 0 |a Formal languages, automata and numeration systems.  |n 2,  |p Applications to recognizability and decidability /  |c Michel Rigo. 
246 3 0 |a Applications to recognizability and decidability 
264 1 |a London :  |b ISTE Ltd ;  |a Hoboken, NJ :  |b John Wiley & Sons, Inc.,  |c 2014. 
300 |a 1 online resource (xix, 234 pages) 
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 
504 |a Includes bibliographical references and index. 
588 0 |a Print version record. 
505 0 |a 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: Crash Course on Regular Languages; 1.1. Automata and regular languages; 1.2. Adjacency matrix; 1.3. Multidimensional alphabet; 1.4. Two pumping lemmas; 1.5. The minimal automaton; 1.6. Some operations preserving regularity; 1.7. Links with automatic sequences and recognizable sets; 1.8. Polynomial regular languages; 1.8.1. Tiered words. 
505 8 |a 1.8.2. Characterization of regular languages of polynomial growth1.8.3. Growing letters in morphic words; 1.9. Bibliographic notes and comments; 2: A Range of Numeration Systems; 2.1. Substitutive systems; 2.2. Abstract numeration systems; 2.2.1. Generalization of Cobham's theorem on automatic sequences; 2.2.2. Some properties of abstract numeration systems; 2.3. Positional numeration systems; 2.4. Pisot numeration systems; 2.5. Back to [Beta]-expansions; 2.5.1. Representation of real numbers; 2.5.2. Link between representations of integers and real numbers. 
505 8 |6 880-01  |a 2.5.3. Ito-Sadahiro negative base systems2.6. Miscellaneous systems; 2.7. Bibliographical notes and comments; 3: Logical Framework and Decidability Issues; 3.1. A glimpse at mathematical logic; 3.1.1. Syntax; 3.1.2. Semantics; 3.2. Decision problems and decidability; 3.3. Quantifier elimination in Presburger arithmetic; 3.3.1. Equivalent structures; 3.3.2. Presburger's theorem and quantifier elimination; 3.3.3. Some consequences of Presburger's theorem; 3.4. Büchi's theorem; 3.4.1. Definable sets; 3.4.2. A constructive proof of Büchi's theorem; 3.4.3. Extension to Pisot numeration systems. 
505 8 |a 3.5. Some applications3.5.1. Properties about automatic sequences; 3.5.2. Overlap-freeness; 3.5.3. Abelian unbordered factors; 3.5.4. Periodicity; 3.5.5. Factors; 3.5.6. Applications to Pisot numeration systems; 3.6. Bibliographic notes and comments; 4: List of Sequences; Bibliography; Index; Volume 1 -- Contents; Volume 1 -- Index. 
520 |a The interplay between words, computability, algebra and arithmetic has now proved its relevance and fruitfulness. Indeed, the cross-fertilization between formal logic and finite automata (such as that initiated by J.R. Büchi) or between combinatorics on words and number theory has paved the way to recent dramatic developments, for example, the transcendence results for the real numbers having a "simple" binary expansion, by B. Adamczewski and Y. Bugeaud. This book is at the heart of this interplay through a unified exposition. Objects are considered with a perspective that comes both from t. 
590 |a ProQuest Ebook Central  |b Ebook Central Academic Complete 
650 0 |a Machine theory. 
650 0 |a Computer programming. 
650 4 |a Computer programming  |v Congresses. 
650 4 |a Formal languages  |v Congresses. 
650 4 |a Machine theory  |v Congresses. 
650 6 |a Théorie des automates. 
650 6 |a Programmation (Informatique) 
650 7 |a computer programming.  |2 aat 
650 7 |a REFERENCE  |x Questions & Answers.  |2 bisacsh 
650 7 |a Computer programming  |2 fast 
650 7 |a Machine theory  |2 fast 
776 0 8 |i Print version:  |a Rigo, Michel.  |t Formal languages, automata and numeration systems. 2, Applications to recognizability and decidability.  |z 9781848217881  |z 1848217889 
830 0 |a Networks and telecommunications series. 
856 4 0 |u https://ebookcentral.uam.elogim.com/lib/uam-ebooks/detail.action?docID=1784151  |z Texto completo 
880 8 |6 505-01/(S  |a 1.8.2. Characterization of regular languages of polynomial growth1.8.3. Growing letters in morphic words; 1.9. Bibliographic notes and comments; 2: A Range of Numeration Systems; 2.1. Substitutive systems; 2.2. Abstract numeration systems; 2.2.1. Generalization of Cobham's theorem on automatic sequences; 2.2.2. Some properties of abstract numeration systems; 2.3. Positional numeration systems; 2.4. Pisot numeration systems; 2.5. Back to β-expansions; 2.5.1. Representation of real numbers; 2.5.2. Link between representations of integers and real numbers. 
936 |a BATCHLOAD 
938 |a Askews and Holts Library Services  |b ASKH  |n AH27081069 
938 |a ProQuest Ebook Central  |b EBLB  |n EBL1784151 
938 |a ebrary  |b EBRY  |n ebr10930300 
938 |a EBSCOhost  |b EBSC  |n 846056 
938 |a Recorded Books, LLC  |b RECE  |n rbeEB00585813 
938 |a YBP Library Services  |b YANK  |n 12077653 
938 |a YBP Library Services  |b YANK  |n 12673883 
938 |a YBP Library Services  |b YANK  |n 12081255 
994 |a 92  |b IZTAP