Automata for Branching and Layered Temporal Structures [electronic resource] : An Investigation into Regularities of Infinite Transition Systems / by Gabriele Puppis.
Tipo de material:
TextoSeries Lecture Notes in Computer Science, 5955Editor: Berlin, Heidelberg : Springer Berlin Heidelberg, 2010Descripción: 206p. 41 illus. online resourceTipo de contenido: text Tipo de medio: computer Tipo de portador: online resourceISBN: 9783642118814Trabajos contenidos: SpringerLink (Online service)Tema(s): Computer science | Software engineering | Computer software | Logic design | Artificial intelligence | Computer Science | Artificial Intelligence (incl. Robotics) | Logics and Meanings of Programs | Software Engineering | Mathematical Logic and Formal Languages | Programming Languages, Compilers, Interpreters | Algorithm Analysis and Problem ComplexityFormatos físicos adicionales: Sin títuloClasificación CDD: 006.3 Clasificación LoC:Q334-342TJ210.2-211.495Recursos en línea: de clik aquí para ver el libro electrónico 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.
ZDB-2-SCS
ZDB-2-LNC
No hay comentarios en este titulo.