Automata for Branching and Layered Temporal Structures An Investigation into Regularities of Infinite Transition Systems /

• Κύριος συγγραφέας: Puppis, Gabriele (Συγγραφέας)
• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2010.
• Σειρά: Lecture Notes in Computer Science, 5955
• Θέματα: Computer science.; Software engineering.; Programming languages (Electronic computers).; Computer logic.; Mathematical logic.; Artificial intelligence.; Computer Science.; Artificial Intelligence (incl. Robotics).; Software Engineering/Programming and Operating Systems.; Programming Languages, Compilers, Interpreters.; Logics and Meanings of Programs.; Software Engineering.; Mathematical Logic and Formal Languages.
• Φυσική περιγραφή: 206 p. 41 illus. online resource.
• ISBN: 9783642118814
• ISSN: 0302-9743 ;

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.