Automata for Branching and Layered Temporal Structures An Investigation into Regularities of Infinite Transition Systems /

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...

Full description

Bibliographic Details
Main Author: Puppis, Gabriele. (Author)
Corporate Author: SpringerLink (Online service)
Format: Electronic
Language:English
Published: Berlin, Heidelberg : Springer Berlin Heidelberg, 2010.
Series:Lecture Notes in Computer Science, 5955
Subjects:
Online Access:https://ezaccess.library.uitm.edu.my/login?url=http://dx.doi.org/10.1007/978-3-642-11881-4
LEADER 02760nam a22005535i 4500
001 10473
003 DE-He213
005 20130725195016.0
007 cr nn 008mamaa
008 100715s2010 gw | s |||| 0|eng d
020 # # |a 9783642118814  |9 978-3-642-11881-4 
024 7 # |a 10.1007/978-3-642-11881-4  |2 doi 
050 # 4 |a Q334-342 
050 # 4 |a TJ210.2-211.495 
072 # 7 |a UYQ  |2 bicssc 
072 # 7 |a TJFM1  |2 bicssc 
072 # 7 |a COM004000  |2 bisacsh 
082 0 4 |a 006.3  |2 23 
100 1 # |a Puppis, Gabriele.  |e author. 
245 1 0 |a Automata for Branching and Layered Temporal Structures  |b An Investigation into Regularities of Infinite Transition Systems /  |c by Gabriele Puppis.  |h [electronic resource] : 
264 # 1 |a Berlin, Heidelberg :  |b Springer Berlin Heidelberg,  |c 2010. 
300 # # |a 206p. 41 illus.  |b online resource. 
336 # # |a text  |b txt  |2 rdacontent 
337 # # |a computer  |b c  |2 rdamedia 
338 # # |a online resource  |b cr  |2 rdacarrier 
347 # # |a text file  |b PDF  |2 rda 
490 1 # |a Lecture Notes in Computer Science,  |v 5955  |x 0302-9743 ; 
520 # # |a 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. 
650 # 0 |a Computer science. 
650 # 0 |a Software engineering. 
650 # 0 |a Computer software. 
650 # 0 |a Logic design. 
650 # 0 |a Artificial intelligence. 
650 1 4 |a Computer Science. 
650 2 4 |a Artificial Intelligence (incl. Robotics). 
650 2 4 |a Logics and Meanings of Programs. 
650 2 4 |a Software Engineering. 
650 2 4 |a Mathematical Logic and Formal Languages. 
650 2 4 |a Programming Languages, Compilers, Interpreters. 
650 2 4 |a Algorithm Analysis and Problem Complexity. 
710 2 # |a SpringerLink (Online service) 
773 0 # |t Springer eBooks 
776 0 8 |i Printed edition:  |z 9783642118807 
830 # 0 |a Lecture Notes in Computer Science,  |v 5955  |x 0302-9743 ; 
856 4 0 |u https://ezaccess.library.uitm.edu.my/login?url=http://dx.doi.org/10.1007/978-3-642-11881-4 
912 # # |a ZDB-2-SCS 
912 # # |a ZDB-2-LNC 
950 # # |a Computer Science (Springer-11645)