TY  - BOOK
AU  - 
ED  - SpringerLink (Online service)
TI  - Automata for Branching and Layered Temporal Structures: An Investigation into Regularities of Infinite Transition Systems 
T2  - Lecture Notes in Computer Science,
SN  - 9783642118814
AV  - Q334-342 
U1  - 006.3 23
PY  - 2010///
CY  - Berlin, Heidelberg
PB  - Springer Berlin Heidelberg
KW  - Computer science
KW  - Software engineering
KW  - Computer software
KW  - Logic design
KW  - Artificial intelligence
KW  - Computer Science
KW  - Artificial Intelligence (incl. Robotics)
KW  - Logics and Meanings of Programs
KW  - Software Engineering
KW  - Mathematical Logic and Formal Languages
KW  - Programming Languages, Compilers, Interpreters
KW  - Algorithm Analysis and Problem Complexity
N1  - Word Automata and Time Granularities -- Tree Automata and Logics -- Summary; ZDB-2-SCS; ZDB-2-LNC
N2  - 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
UR  - http://dx.doi.org/10.1007/978-3-642-11881-4
ER  -