新生學校財團法人新生醫護管理專科學校圖書館 |

Infinite words = automata, semigroups, logic and games /

Record Type:	Electronic resources : Monograph/item
Title/Author:	Infinite words/ Dominique Perrin and Jean-�Eric Pin.
Reminder of title:	automata, semigroups, logic and games /
Author:	Perrin, Dominique.
other author:	Pin, Jean Eric.
Published:	Amsterdam ;Elsevier, : 2004.,
Description:	1 online resource (xi, 538 p.) :ill. :
Notes:	"Academic Press."
Subject:	Machine theory. -
Online resource:	http://www.sciencedirect.com/science/book/9780125321112
ISBN:	9780125321112

Infinite words = automata, semigroups, logic and games /
Perrin, Dominique.

Infinite wordsautomata, semigroups, logic and games /[electronic resource] :Dominique Perrin and Jean-�Eric Pin. - 1st ed. - Amsterdam ;Elsevier,2004. - 1 online resource (xi, 538 p.) :ill. - Pure and applied mathematics series ;141. - Pure and applied mathematics (Academic Press) ;141..

"Academic Press."

Includes bibliographical references (p. [499]-521).

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.

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.

ISBN: 9780125321112

Source: 98488:98491Elsevier Science & Technologyhttp://www.sciencedirect.com

Nat. Bib. Agency Control No.: 0125321112UkSubjects--Topical Terms:

96417
Machine theory.
Index Terms--Genre/Form:

96803
Electronic books.

LC Class. No.: QA267 / .P47 2004eb

Dewey Class. No.: 512.2

Infinite words = automata, semigroups, logic and games /
LDR:05167cmm 2200457Ia 4500 001 139662
005 20120813083217.0
006 m d
007 cr cn|||||||||
008 160121s2004 ne a ob 001 0 eng d
016 7 $a 0125321112 $2 Uk
019 $a 173221879 $a 441792791 $a 779919358
020 $a 9780125321112
020 $a 0125321112
020 $a 9780080525648 (electronic bk.)
020 $a 0080525644 (electronic bk.)
020 $a 9786611025182
020 $a 6611025189
029 1 $a NZ1 $b 12433774
029 1 $a AU@ $b 000048129788
035 $a ocn162682102
037 $a 98488:98491 $b Elsevier Science & Technology $n http://www.sciencedirect.com
040 $a OPELS $b eng $c OPELS $d OPELS $d OCLCQ $d N $d YDXCP $d MERUC $d IDEBK $d TULIB $d OCLCO
049 $a NTYA
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. $3 257239
245 1 0 $a Infinite words $h [electronic resource] : $b automata, semigroups, logic and games / $c Dominique Perrin and Jean-�Eric Pin.
250 $a 1st ed.
260 $a Amsterdam ; $a Boston : $c 2004. $b Elsevier,
300 $a 1 online resource (xi, 538 p.) : $b ill.
490 1 $a Pure and applied mathematics series ; $v 141
500 $a "Academic Press."
504 $a Includes bibliographical references (p. [499]-521).
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.
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.
588 $a Description based on print version record.
650 0 $a Machine theory. $3 96417
650 0 $a Group theory. $3 122674
650 6 $a Automates math�ematiques, Th�eorie des. $3 257241
650 6 $a Groupes, Th�eorie des. $3 257242
650 1 7 $a Automatentheorie. $2 gtt $3 257243
650 1 7 $a Speltheorie. $2 gtt $3 257244
650 1 7 $a Logica. $2 gtt $3 257245
650 1 7 $a Groepentheorie. $2 gtt $3 257246
650 1 7 $a Topologie. $2 gtt $3 257247
650 7 $a MATHEMATICS $x Group Theory. $2 bisacsh $3 257248
655 4 $a Electronic books. $2 local. $3 96803
700 1 $a Pin, Jean Eric. $3 257240
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. $3 257238
856 4 0 $3 ScienceDirect $u http://www.sciencedirect.com/science/book/9780125321112
856 $z Full text $u http://www.sciencedirect.com/science/publication?issn=00798169&volume=141
938 $a YBP Library Services $b YANK $n 2614401
938 $a Ingram Digital eBook Collection $b IDEB $n 102518