Cargando…
Infinite words : automata, semigroups, logic and games /
Infinite Words is an important theory in both Mathematics and Computer Sciences. Many new developments have been made in the field, encouraged by its application to problems in computer science. Infinite Words is the first manual devoted to this topic. Infinite Words explores all aspects of the theo...
| Clasificación: | Libro Electrónico |
|---|---|
| Autor principal: | |
| Otros Autores: | |
| Formato: | Electrónico eBook |
| Idioma: | Inglés |
| Publicado: |
Amsterdam ; Boston :
Elsevier,
2004.
|
| Edición: | 1st ed. |
| Colección: | Pure and applied mathematics (Academic Press) ;
141. |
| Temas: | |
| Acceso en línea: | Texto completo Texto completo Texto completo |
MARC
| LEADER | 00000cam a2200000 a 4500 | ||
|---|---|---|---|
| 001 | SCIDIR_ocn162682102 | ||
| 003 | OCoLC | ||
| 005 | 20231117015038.0 | ||
| 006 | m o d | ||
| 007 | cr cn||||||||| | ||
| 008 | 070806s2004 ne a ob 001 0 eng d | ||
| 040 | |a OPELS |b eng |e pn |c OPELS |d OPELS |d OCLCQ |d N$T |d YDXCP |d MERUC |d IDEBK |d TULIB |d OCLCO |d OCLCQ |d OPELS |d OCLCF |d DEBBG |d DEBSZ |d OCLCQ |d U3W |d D6H |d NLE |d LEAUB |d OL$ |d BWN |d OCLCQ |d OCLCO |d COM |d OCLCQ | ||
| 016 | 7 | |a 0125321112 |2 Uk | |
| 019 | |a 173221879 |a 441792791 |a 779919358 |a 989426915 |a 1110254535 | ||
| 020 | |a 9780125321112 | ||
| 020 | |a 0125321112 | ||
| 020 | |a 9780080525648 |q (electronic bk.) | ||
| 020 | |a 0080525644 |q (electronic bk.) | ||
| 035 | |a (OCoLC)162682102 |z (OCoLC)173221879 |z (OCoLC)441792791 |z (OCoLC)779919358 |z (OCoLC)989426915 |z (OCoLC)1110254535 | ||
| 050 | 4 | |a QA267 |b .P47 2004eb | |
| 072 | 7 | |a MAT |x 014000 |2 bisacsh | |
| 082 | 0 | 4 | |a 512.2 |2 22 |
| 100 | 1 | |a Perrin, Dominique. | |
| 245 | 1 | 0 | |a Infinite words : |b automata, semigroups, logic and games / |c Dominique Perrin and Jean-�Eric Pin. |
| 250 | |a 1st ed. | ||
| 260 | |a Amsterdam ; |a Boston : |b Elsevier, |c 2004. | ||
| 300 | |a 1 online resource (xi, 538 pages) : |b illustrations | ||
| 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 Pure and applied mathematics series ; |v 141 | |
| 520 | |a Infinite Words is an important theory in both Mathematics and Computer Sciences. Many new developments have been made in the field, encouraged by its application to problems in computer science. Infinite Words is the first manual devoted to this topic. Infinite Words explores all aspects of the theory, including Automata, Semigroups, Topology, Games, Logic, Bi-infinite Words, Infinite Trees and Finite Words. The book also looks at the early pioneering work of Bochi, McNaughton and Sch�atzenberger. Serves as both an introduction to the field and as a reference book. Contains numerous exercises desgined to aid students and readers. Self-contained chapters provide helpful guidance for lectures. | ||
| 500 | |a "Academic Press." | ||
| 504 | |a Includes bibliographical references (pages 499-521). | ||
| 588 | 0 | |a Print version record. | |
| 505 | 0 | |a Cover -- Contents -- Preface -- Chapter I. AUTOMATA AND INFINITE WORDS -- 1. Introduction -- 2. Words and trees -- 3. Rational sets of infinite words -- 4. Automata -- 5. B�uchi automata -- 6. Deterministic B�uchi automata -- 7. Muller and Rabin automata -- 8. Transition automata -- 9. McNaughton's theorem -- 10. Computational complexity issues -- 11. Exercises -- 12. Notes -- Chapter II. AUTOMATA AND SEMIGROUPS -- 1. Introduction -- 2. Ramseyan factorizations and linked pairs -- 3. Recognition by morphism -- 4. Semigroups and infinite products -- 5. Wilke Algebras -- 6. Recognition by morphism of?-semigroups -- 7. The two modes of recognition -- 8. Syntactic congruence -- 9. Back to McNaughton's theorem -- 10. Prophetic automata -- 11. Exercises -- 12. Notes -- Chapter III. AUTOMATA AND TOPOLOGY -- 1. Introduction -- 2. Topological spaces -- 3. The space of infinite words -- 4. The space of finite or infinite words -- 5. Borel automata -- 6. Suslin sets -- 7. The separation theorem -- 8. Exercises -- 9. Notes -- Chapter IV. GAMES AND STRATEGIES -- 1. Introduction -- 2. Infinite games -- 3. Borel games -- 4. Games on graphs -- 5. Wadge games -- 6. Exercises -- 7. Notes -- Chapter V. WAGNER HIERARCHY -- 1. Introduction -- 2. Ordinals -- 3. Classes of sets -- 4. Chains -- 5. Superchains -- 6. The Wagner hierarchy -- 7. Exercises -- 8. Notes -- Chapter VI. VARIETIES -- 1. Introduction -- 2. Varieties of finite or infinite words -- 3. Varieties and topology -- 4. Weak recognition -- 5. Extensions of McNaughton's theorem -- 6. Varieties closed under aperiodic extension -- 7. Concatenation hierarchies for infinite words -- 8. Exercises -- 9. Notes -- Chapter VII. LOCAL PROPERTIES -- 1. Introduction -- 2. Weak recognition -- 3. Local properties of infinite words -- 4. Exercises -- 5. Notes -- Chapter VIII. AN EXCURSION INTO LOGIC -- 1. Introduction -- 2. The formalism of logic -- 3. Monadic second-order logic on words -- 4. First-order logic of the linear order -- 5. First-order logic of the successor -- 6. Temporal logic -- 7. Restricted temporal logic -- 8. Exercises -- 9. Notes -- Chapter IX. BI-INFINITE WORDS -- 1. Introduction -- 2. Bi-infinite words -- 3. Determinism -- 4. Morphisms -- 5. Unambiguous automata on bi-infinite words -- 6. Discrimination -- 7. Logic on Z -- 8. Exercises -- 9. Notes -- Chapter X. INFINITE TREES -- 1. Introduction -- 2. Finite and Infinite trees -- 3. Tree automata -- 4. Tree automata and games -- 5. Topology -- 6. Monadic second order logic of two successors -- 7. Effective algorithms -- 8. Exercises -- 9. Notes -- ANNEX A. FINITE SEMIGROUPS -- 1. Monoids. | |
| 650 | 0 | |a Machine theory. | |
| 650 | 0 | |a Group theory. | |
| 650 | 6 | |a Th�eorie des automates. |0 (CaQQLa)201-0002733 | |
| 650 | 6 | |a Th�eorie des groupes. |0 (CaQQLa)201-0000039 | |
| 650 | 7 | |a MATHEMATICS |x Group Theory. |2 bisacsh | |
| 650 | 7 | |a Group theory. |2 fast |0 (OCoLC)fst00948521 | |
| 650 | 7 | |a Machine theory. |2 fast |0 (OCoLC)fst01004846 | |
| 650 | 1 | 7 | |a Automatentheorie. |2 gtt |
| 650 | 1 | 7 | |a Speltheorie. |2 gtt |
| 650 | 1 | 7 | |a Logica. |2 gtt |
| 650 | 1 | 7 | |a Groepentheorie. |2 gtt |
| 650 | 1 | 7 | |a Topologie. |2 gtt |
| 700 | 1 | |a Pin, Jean Eric. | |
| 776 | 0 | 8 | |i Print version: |a Perrin, Dominique. |t Infinite words. |b 1st ed. |d Amsterdam ; Boston : Elsevier, 2004 |z 0125321112 |z 9780125321112 |w (DLC) 2006277681 |w (OCoLC)51914111 |
| 830 | 0 | |a Pure and applied mathematics (Academic Press) ; |v 141. | |
| 856 | 4 | 0 | |u https://sciencedirect.uam.elogim.com/science/book/9780125321112 |z Texto completo |
| 856 | 4 | 0 | |u https://sciencedirect.uam.elogim.com/science/publication?issn=00798169&volume=141 |z Texto completo |
| 856 | 4 | 0 | |u https://sciencedirect.uam.elogim.com/science/bookseries/00798169/141 |z Texto completo |