Advertisement

© 2010

Automata for Branching and Layered Temporal Structures

An Investigation into Regularities of Infinite Transition Systems

Benefits

  • LLI LNAI monograph

Book
  • 1.2k Downloads

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

Also part of the Lecture Notes in Artificial Intelligence book sub series (LNAI, 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

  1. 1.Department of Mathematics and Computer ScienceUniversity of UdineUdineItaly

Bibliographic information

Industry Sectors
Automotive
Chemical Manufacturing
Biotechnology
IT & Software
Telecommunications
Law
Consumer Packaged Goods
Pharma
Materials & Steel
Finance, Business & Banking
Electronics
Energy, Utilities & Environment
Aerospace
Oil, Gas & Geosciences
Engineering

Reviews

“The thesis is a very nice introduction to the area of time granularities and indeed also automata on infinite strings or trees. All major notions are discussed, formally introduced, exemplified, and compared to similar notions. The language is generally appropriate and understandable and the mathematics in the contribution should be understandable by any graduate student. Since the essential definitions and proofs are provided, the book can easily be read without additional literature.” (Andreas Maletti, Mathematical Reviews, February, 2016)