02681nam 2200589 450 99646533020331620210216145350.01-280-38576-697866135636823-642-11881-X10.1007/978-3-642-11881-4(CKB)2670000000003381(EBL)3065029(SSID)ssj0000355447(PQKBManifestationID)11249113(PQKBTitleCode)TC0000355447(PQKBWorkID)10320112(PQKB)10578250(DE-He213)978-3-642-11881-4(MiAaPQ)EBC3065029(MiAaPQ)EBC6351855(PPN)149073593(EXLCZ)99267000000000338120210216d2010 uy 0engur|n|---|||||txtccrAutomata for branching and layered temporal structures an investigation into regularities of infinite transition systems /Gabriele Puppis1st ed. 2010.Berlin ;Heidelberg :Springer,[2010]©20101 online resource (212 p.)Lecture notes in artificial intelligence ;5955Description based upon print version of record.3-642-11880-1 Includes bibliobraphical references and index.Word Automata and Time Granularities -- Tree Automata and Logics -- Summary.Since 2002, FoLLI awards an annual prize for an outstanding dissertation in the fields of Logic, Language, and Information. This book is based on the Ph.D. thesis of Gabriele Puppis, who was the winner of the E.W. Beth dissertation award for 2007. Puppis' thesis focuses on Logic and Computation and, more specifically, on automata-based decidability techniques for time granularity and on a new method for deciding Monadic Second Order theories of trees. The results presented represent a significant step towards a better understanding of the changes in granularity levels that humans make so easily in cognition of time, space, and other phenomena, whereas their logical and computational structure poses difficult conceptual and computational challenges.Lecture notes in computer science.Lecture notes in artificial intelligence ;5955.Machine theoryMachine theory.510.904Puppis Gabriele1221181MiAaPQMiAaPQMiAaPQBOOK996465330203316Automata for branching and layered temporal structures2831523UNISA