LEADER 05217nam 2200661Ia 450 001 9910783144503321 005 20230607215318.0 010 $a1-281-95168-4 010 $a9786611951689 010 $a981-281-016-1 035 $a(CKB)1000000000017054 035 $a(EBL)1681248 035 $a(OCoLC)815754709 035 $a(SSID)ssj0000166911 035 $a(PQKBManifestationID)11151651 035 $a(PQKBTitleCode)TC0000166911 035 $a(PQKBWorkID)10161882 035 $a(PQKB)11373755 035 $a(MiAaPQ)EBC1681248 035 $a(WSP)00004672 035 $a(Au-PeEL)EBL1681248 035 $a(CaPaEBR)ebr10255940 035 $a(CaONFJC)MIL195168 035 $a(EXLCZ)991000000000017054 100 $a20010821d2001 uy 0 101 0 $aeng 135 $aur|n|---||||| 181 $ctxt 182 $cc 183 $acr 200 02$aA half-century of automata theory$b[electronic resource] $ecelebration and inspiration /$feditors, A. Salomaa, D. Wood, S. Yu 210 $aRiver Edge, N.J. $cWorld Scientific$dc2001 215 $a1 online resource (164 p.) 300 $aDescription based upon print version of record. 311 $a981-02-4590-4 320 $aIncludes bibliographical references. 327 $aCONTENTS ; Preface ; Hazard Algebras (Extended Abstract) ; 1 Introduction ; 2 Transients ; 3 Change-Counting Algebra ; 4 Counting Changes to a Threshold ; 5 Circuit Simulations ; 6 Extensions of Boolean Functions ; 7 Complexity Issues ; 8 Conclusions ; References 327 $aUndecidability and Incompleteness Results in Automata Theory 1 Introduction ; 2 Basic Concepts and II2-Completeness; 3 Undecidability and Incompleteness Results ; 4 Representation Independent Incompleteness Results ; 5 Incomplete Languages ; 6 Minimal Automata and Incompleteness ; 7 Succinctness Results 327 $a8 Conclusion References ; Automata Theory: Its Past and Future ; 1 Introduction ; 2 Beginnings of Automata Theory ; 3 External Changes Impacting Future Directions ; 4 Conclusions ; References ; Forty Years of Formal Power Series in Automata Theory ; 1 Introduction 327 $a2 Continuous monoids and semirings 3 Automata and the Theorem of Kleene ; 4 Algebraic systems and pushdown automata ; 5 Principal cones of algebraic power series ; 6 Decidability questions ; References ; Playing Infinite Games in Finite Time ; 1 Infinite games ; 2 The score function 327 $a3 Theoretical results about scoring 4 When to end the play ; 5 Finding playable games ; 6 A specific suggestion ; References ; Gene Assembly in Ciliates: Computing by Folding and Recombination ; Introduction. ; 1 Preliminaries. ; 2 DNA molecules: structure and notation. 327 $a3 Gene assembly in ciliates. 330 $a This volume gathers lectures by 8 distinguished pioneers of automata theory, including two Turing Award winners. In each contribution, the early developments of automata theory are reminisced about and future directions are suggested. Although some of the contributions go into rather intriguing technical details, most of the book is accessible to a wide audience interested in the progress of the age of computers. The book is a must for professionals in theoretical computer science and related areas of mathematics. For students in these areas it provides an exceptionally deep view at the begi 606 $aMachine theory$vCongresses 606 $aAlgebra$vCongresses 615 0$aMachine theory 615 0$aAlgebra 676 $a511.3 701 $aSalomaa$b Arto$025836 701 $aWood$b Derick$f1940-$0543189 701 $aYu$b Sheng$01530175 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910783144503321 996 $aA half-century of automata theory$93775033 997 $aUNINA