LEADER 03579nam  22006615  450 
001 9911035049703321
005 20251029120434.0
010   $a9783662721544$b(electronic bk.)
010   $z9783662721537
024 7 $a10.1007/978-3-662-72154-4
035   $a(MiAaPQ)EBC32381975
035   $a(Au-PeEL)EBL32381975
035   $a(CKB)41986439800041
035   $a(DE-He213)978-3-662-72154-4
035   $a(OCoLC)1549524717
035   $a(EXLCZ)9941986439800041
100   $a20251029d2025      u|         0
101 0 $aeng
135   $aurcnu||||||||
181   $ctxt$2rdacontent
182   $cc$2rdamedia
183   $acr$2rdacarrier
200 10$aAutomata Theory and Logic /$fby Martin Hofmann, Martin Lange
205   $a1st ed. 2025.
210  1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer Vieweg,$d2025.
215   $a1 online resource (425 pages)
225 1 $aComputer Science and Engineering (German Language) Series
311 08$aPrint version: Hofmann, Martin Automata Theory and Logic Berlin, Heidelberg : Springer Berlin / Heidelberg,c2025 9783662721537 
327   $aMonadic second order logic -- Alternating automata -- Star-free languages -- Omega-regular languages -- Büchi automata -- Parity games -- Tree automata.
330   $aThis book introduces the reader into the field of automata theory and logic. It studies fundamental properties like complementation and determinisation of automata on infinite words and trees, and presents their applications for logics used in program verification. The presentation of such concepts ? some of which are 50 years old or more ? is given in a modern style and is accompanied by many exercises. The book can be used for self-study or as a basis for a graduate course on automata and logic, presupposing knowledge on finite automata and regular languages of finite words only. Contents Monadic second-order logic Alternating automata Star-free languages Omega-regular languages Büchi automata Parity games Tree automata The Authors Martin Hofmann held the chair for theoretical computer science at LMU Munich, Germany. He made significant contributions to logic in computer science including type theory, semantics, program analysis and complexity theory. Martin Lange works on foundations of program verification using temporal logics and games. He is head of the department of theoretical computer science and formal methods at the University of Kassel, Germany.
410  0$aComputer Science and Engineering (German Language) Series
606   $aMachine theory
606   $aComputer science
606   $aComputational complexity
606   $aFormal Languages and Automata Theory
606   $aComputer Science
606   $aTheory of Computation
606   $aComputer Science Logic and Foundations of Programming
606   $aModels of Computation
606   $aComputational Complexity
615  0$aMachine theory.
615  0$aComputer science.
615  0$aComputational complexity.
615 14$aFormal Languages and Automata Theory.
615 24$aComputer Science.
615 24$aTheory of Computation.
615 24$aComputer Science Logic and Foundations of Programming.
615 24$aModels of Computation.
615 24$aComputational Complexity.
676   $a005.131
700   $aHofmann$b Martin$0850011
701   $aLange$b Martin$01837056
801  0$bMiAaPQ
801  1$bMiAaPQ
801  2$bMiAaPQ
912   $a9911035049703321
996   $aAutomata Theory and Logic$94451883
997   $aUNINA