Perrin, Dominique; Pin, Jean-Éric Infinite words. Automata, semigroups, logic and games. (English) Zbl 1094.68052 Pure and Applied Mathematics (Amsterdam) 141. Amsterdam: Elsevier/Academic Press (ISBN 0-12-532111-2/hbk). xi, 538 p. (2004). Publisher’s description: Infinite Words is an important theory in both mathematics and computer science. Many new developments have been made in the field, encouraged by its application to problems in computer science. This book is the first manual devoted to this topic.The book 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 Büchi, McNaughton and Schützenberger. Cited in 234 Documents MSC: 68Q45 Formal languages and automata 68R15 Combinatorics on words 68-01 Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science 68-02 Research exposition (monographs, survey articles) pertaining to computer science 20M35 Semigroups in automata theory, linguistics, etc. 91A80 Applications of game theory Keywords:bi-infinite words; infinite trees; finite words Software:MONA × Cite Format Result Cite Review PDF Full Text: Link