Logo - springer
Slogan - springer

Computer Science - Artificial Intelligence | Automata for Branching and Layered Temporal Structures - An Investigation into Regularities of

Automata for Branching and Layered Temporal Structures

An Investigation into Regularities of Infinite Transition Systems

Puppis, Gabriele

2010, 206p. 41 illus..

Available Formats:
eBook
Information

Springer eBooks may be purchased by end-customers only and are sold without copy protection (DRM free). Instead, all eBooks include personalized watermarks. This means you can read the Springer eBooks across numerous devices such as Laptops, eReaders, and tablets.

You can pay for Springer eBooks with Visa, Mastercard, American Express or Paypal.

After the purchase you can directly download the eBook file or read it online in our Springer eBook Reader. Furthermore your eBook will be stored in your MySpringer account. So you can always re-download your eBooks.

 
$69.99

(net) price for USA

ISBN 978-3-642-11881-4

digitally watermarked, no DRM

Included Format: PDF

download immediately after purchase


learn more about Springer eBooks

add to marked items

Softcover
Information

Softcover (also known as softback) version.

You can pay for Springer Books with Visa, Mastercard, American Express or Paypal.

Standard shipping is free of charge for individual customers.

 
$99.00

(net) price for USA

ISBN 978-3-642-11880-7

free shipping for individuals worldwide

usually dispatched within 3 to 5 business days


add to marked items

  • FoLLI LNAI monograph  

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.

Content Level » Research

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

Related subjects » Artificial Intelligence - Software Engineering - Theoretical Computer Science

Table of contents 

Word Automata and Time Granularities.- Tree Automata and Logics.- Summary.

Popular Content within this publication 

 

Articles

Read this Book on Springerlink

Services for this book

New Book Alert

Get alerted on new Springer publications in the subject area of Artificial Intelligence (incl. Robotics).