Automata for Branching and Layered Temporal Structures

An Investigation into Regularities of Infinite Transition Systems

  • GabrieleĀ Puppis
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5955)

Table of contents

  1. Front Matter
  2. Gabriele Puppis
    Pages 1-3
  3. Gabriele Puppis
    Pages 5-88
  4. Gabriele Puppis
    Pages 89-167
  5. Gabriele Puppis
    Pages 169-170
  6. Back Matter

About this book

Introduction

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.

Keywords

algorithms artificial intelligence automata languages automata theory bisimulation cognition complexity decidability determininistic trees efficient algorithms finite-state machines higher order logic infinite systems logic

Authors and affiliations

  • GabrieleĀ Puppis
    • 1
  1. 1.Department of Mathematics and Computer ScienceUniversity of UdineUdineItaly

Bibliographic information

  • DOI https://doi.org/10.1007/978-3-642-11881-4
  • Copyright Information Springer-Verlag Berlin Heidelberg 2010
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Computer Science
  • Print ISBN 978-3-642-11880-7
  • Online ISBN 978-3-642-11881-4
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • About this book