Overview
- LLI LNAI monograph
Part of the book series: Lecture Notes in Computer Science (LNCS, volume 5955)
Part of the book sub series: Lecture Notes in Artificial Intelligence (LNAI)
Access this book
Tax calculation will be finalised at checkout
Other ways to access
About this book
Similar content being viewed by others
Keywords
Table of contents (4 chapters)
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)
Authors and Affiliations
Bibliographic Information
Book Title: Automata for Branching and Layered Temporal Structures
Book Subtitle: An Investigation into Regularities of Infinite Transition Systems
Authors: Gabriele Puppis
Series Title: Lecture Notes in Computer Science
DOI: https://doi.org/10.1007/978-3-642-11881-4
Publisher: Springer Berlin, Heidelberg
eBook Packages: Computer Science, Computer Science (R0)
Copyright Information: Springer-Verlag Berlin Heidelberg 2010
Softcover ISBN: 978-3-642-11880-7Published: 18 February 2010
eBook ISBN: 978-3-642-11881-4Published: 04 February 2010
Series ISSN: 0302-9743
Series E-ISSN: 1611-3349
Edition Number: 1
Number of Pages: 206
Number of Illustrations: 41 b/w illustrations
Topics: Artificial Intelligence, Software Engineering/Programming and Operating Systems, Programming Languages, Compilers, Interpreters, Logics and Meanings of Programs, Software Engineering, Mathematical Logic and Formal Languages