04601nam 2200685 450 991082492270332120200520144314.01-119-04286-01-119-04285-21-119-04295-X(CKB)3710000000239199(EBL)1784151(SSID)ssj0001376223(PQKBManifestationID)11773082(PQKBTitleCode)TC0001376223(PQKBWorkID)11360191(PQKB)10733910(MiAaPQ)EBC1784151(Au-PeEL)EBL1784151(CaPaEBR)ebr10930299(CaONFJC)MIL646261(OCoLC)898157454(PPN)191455660(EXLCZ)99371000000023919920140926h20142014 uy 0engurcnu||||||||txtccrFormal languages, automata and numeration systems 2 /Michel RigoLondon, England ;Hoboken, New Jersey :ISTE :Wiley,2014.©20141 online resource (274 p.)Networks and Telecommunications SeriesDescription based upon print version of record.1-322-15006-0 1-84821-788-9 Includes bibliographical references and 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: 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 words1.8.2. Characterization of regular languages of polynomial growth 1.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 numbers2.5.3. Ito-Sadahiro negative base systems 2.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 systems3.5. Some applications 3.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 - IndexThe 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 fromNetworks and telecommunications series.Computer programmingFormal languagesMachine theoryComputer programming.Formal languages.Machine theory.001.642Rigo Michel888777MiAaPQMiAaPQMiAaPQBOOK9910824922703321Formal languages, automata and numeration systems 23951843UNINA04527nam 2200661 a 450 991095887750332120200520144314.097866122693639780299191733029919173797812822693611282269364(CKB)1000000000817469(OCoLC)489295259(CaPaEBR)ebrary10315783(SSID)ssj0000343148(PQKBManifestationID)11247994(PQKBTitleCode)TC0000343148(PQKBWorkID)10289830(PQKB)10699953(OCoLC)826516983(MdBmJHUP)muse12200(Au-PeEL)EBL3444866(CaPaEBR)ebr10315783(CaONFJC)MIL226936(MiAaPQ)EBC3444866(Perlego)4453180(EXLCZ)99100000000081746920030402e20031983 ub 0engurcn|||||||||txtccrSpelling simplified /Judi Kesselman-Turkel and Franklynn Peterson1st ed.Madison, Wis. University of Wisconsin Press[2003], c19831 online resource (205 p.) Study smart seriesOriginally published: Chicago : Contemporary Books, c1983.9780299191740 0299191745 Includes bibliographical references (p. 153-154).Intro -- Contents -- Introduction: Spelling Makes SEnse -- Part I: The Patterns of English -- Chapter 1: How to Use This Book -- Chapter 2: Check Your Hearing -- Chapter 3: Syllables and Stress -- Chapter 4: Big Words Come from Little Ones -- Part II: Regularities in Native English Words -- Chapter 5: Native English Word Endings -- Chapter 6: When to Double Consonants -- Chapter 7: Helping e -- Part III: Irregularities in Native English Words -- Chapter 8: The Consonant Sound z -- Chapter 9: The Consonant Sound s -- Chapter 10: The Consonant Sounds v and k -- Chapter 11: The Consonant Sound j -- Chapter 12: A Double Sound Represented by One Letter: x -- Chapter 13: Consonant Cluster: qu, ng, wh, ch, sh, and le -- Chapter 14: Silent Consonants and Other Demons -- Part IV: Words Derived from Greek and Latin -- Chapter 15: Regularities in Greek- and Latin-Derived Words -- Chapter 16: The Latin zh and sh Sounds -- Chapter 17: Special Greek-Derived Spellings: ph, y, ch (and rh, mn, pn, and ps) -- Part V: Invasion Words -- Chapter 18: Patterns in Invasion Words -- Chapter 19: Irregular Spellings of Vowel Sounds -- Chapter 20: Vowel Sounds from Other Languages -- Bibliography -- Appendix A: A Directory of Spelling Demons -- Appendix B: Greek- and Latin-Derived Prefixes, Suffixes, and Roots -- Answers to Excercises.THE STUDY SMART SERIES, designed for students from junior high school through lifelong learning programs, teaches skills for research and note-taking, provides exercises to improve grammar, and reveals secrets for putting these skills together in great essays. Millions of people want to learn to spell correctly, but they fear the task will be tedious and painful. Now, with the unique, logical approach presented in Spelling Simplified, anyone can become a skilled speller quickly and easily. Through the use of simple and effective exercises and tips, Spelling Simplified illustrates what many poor spellers forget-that the way a word is spelled is closely related to the sound and meaning of that word. Chapters devoted to syllables and stress, patterns in the language, consonant clusters, and vowel-consonant combinations are included, each complete with its own set of examples and exercises. From the simplest root words through longer words derived from foreign languages, Spelling Simplified guides you through basic techniques for learning how to "hear" a word, how to master irregularities, and how to form large words from smaller ones. Breezily written and easy to use, Spelling Simplified shows that mastering spelling cn be painless-and even fun. Study smart series.English languageOrthography and spellingEnglish languageOrthography and spelling.428.1Kesselman-Turkel Judi1807843Peterson Franklynn1807844MiAaPQMiAaPQMiAaPQBOOK9910958877503321Spelling simplified4363745UNINA