000 02834nam a22005655i 4500
001 978-3-642-11881-4
003 DE-He213
005 20140220084532.0
007 cr nn 008mamaa
008 100715s2010 gw | s |||| 0|eng d
020 _a9783642118814
_9978-3-642-11881-4
024 7 _a10.1007/978-3-642-11881-4
_2doi
050 4 _aQ334-342
050 4 _aTJ210.2-211.495
072 7 _aUYQ
_2bicssc
072 7 _aTJFM1
_2bicssc
072 7 _aCOM004000
_2bisacsh
082 0 4 _a006.3
_223
100 1 _aPuppis, Gabriele.
_eauthor.
245 1 0 _aAutomata for Branching and Layered Temporal Structures
_h[electronic resource] :
_bAn Investigation into Regularities of Infinite Transition Systems /
_cby Gabriele Puppis.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c2010.
300 _a206p. 41 illus.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v5955
505 0 _aWord Automata and Time Granularities -- Tree Automata and Logics -- Summary.
520 _aSince 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 _aComputer science.
650 0 _aSoftware engineering.
650 0 _aComputer software.
650 0 _aLogic design.
650 0 _aArtificial intelligence.
650 1 4 _aComputer Science.
650 2 4 _aArtificial Intelligence (incl. Robotics).
650 2 4 _aLogics and Meanings of Programs.
650 2 4 _aSoftware Engineering.
650 2 4 _aMathematical Logic and Formal Languages.
650 2 4 _aProgramming Languages, Compilers, Interpreters.
650 2 4 _aAlgorithm Analysis and Problem Complexity.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9783642118807
830 0 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v5955
856 4 0 _uhttp://dx.doi.org/10.1007/978-3-642-11881-4
912 _aZDB-2-SCS
912 _aZDB-2-LNC
999 _c111956
_d111956