Central Library

Normal view MARC view ISBD view

Automata for Branching and Layered Temporal Structures [electronic resource] : An Investigation into Regularities of Infinite Transition Systems / by Gabriele Puppis.

By: Puppis, Gabriele [author.].
Contributor(s): SpringerLink (Online service).
Material type: materialTypeLabelBookSeries: Lecture Notes in Artificial Intelligence: 5955Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2010Edition: 1st ed. 2010.Description: 206 p. 41 illus. online resource.Content type: text Media type: computer Carrier type: online resourceISBN: 9783642118814.Subject(s): Artificial intelligence | Software engineering | Compilers (Computer programs) | Computer science | Machine theory | Artificial Intelligence | Software Engineering | Compilers and Interpreters | Computer Science Logic and Foundations of Programming | Formal Languages and Automata TheoryAdditional physical formats: Printed edition:: No title; Printed edition:: No titleDDC classification: 006.3 Online resources: Click here to access online
Contents:
Word Automata and Time Granularities -- Tree Automata and Logics -- Summary.
In: Springer Nature eBookSummary: 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.
    average rating: 0.0 (0 votes)
No physical items for this record

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.

There are no comments for this item.

Log in to your account to post a comment.