|
|
|
|
LEADER |
00000nam a22000005i 4500 |
001 |
978-3-642-11881-4 |
003 |
DE-He213 |
005 |
20221012202541.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 TA347.A78
|
072 |
|
7 |
|a UYQ
|2 bicssc
|
072 |
|
7 |
|a COM004000
|2 bisacsh
|
072 |
|
7 |
|a UYQ
|2 thema
|
082 |
0 |
4 |
|a 006.3
|2 23
|
100 |
1 |
|
|a Puppis, Gabriele.
|e author.
|4 aut
|4 http://id.loc.gov/vocabulary/relators/aut
|
245 |
1 |
0 |
|a Automata for Branching and Layered Temporal Structures
|h [electronic resource] :
|b An Investigation into Regularities of Infinite Transition Systems /
|c by Gabriele Puppis.
|
250 |
|
|
|a 1st ed. 2010.
|
264 |
|
1 |
|a Berlin, Heidelberg :
|b Springer Berlin Heidelberg :
|b Imprint: Springer,
|c 2010.
|
300 |
|
|
|a 206 p. 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 Artificial Intelligence,
|x 2945-9141 ;
|v 5955
|
505 |
0 |
|
|a Word Automata and Time Granularities -- Tree Automata and Logics -- Summary.
|
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 Artificial intelligence.
|
650 |
|
0 |
|a Software engineering.
|
650 |
|
0 |
|a Compilers (Computer programs).
|
650 |
|
0 |
|a Computer science.
|
650 |
|
0 |
|a Machine theory.
|
650 |
1 |
4 |
|a Artificial Intelligence.
|
650 |
2 |
4 |
|a Software Engineering.
|
650 |
2 |
4 |
|a Compilers and Interpreters.
|
650 |
2 |
4 |
|a Computer Science Logic and Foundations of Programming.
|
650 |
2 |
4 |
|a Formal Languages and Automata Theory.
|
710 |
2 |
|
|a SpringerLink (Online service)
|
773 |
0 |
|
|t Springer Nature eBook
|
776 |
0 |
8 |
|i Printed edition:
|z 9783642118821
|
776 |
0 |
8 |
|i Printed edition:
|z 9783642118807
|
830 |
|
0 |
|a Lecture Notes in Artificial Intelligence,
|x 2945-9141 ;
|v 5955
|
856 |
4 |
0 |
|u https://doi.uam.elogim.com/10.1007/978-3-642-11881-4
|z Texto Completo
|
912 |
|
|
|a ZDB-2-SCS
|
912 |
|
|
|a ZDB-2-SXCS
|
912 |
|
|
|a ZDB-2-LNC
|
950 |
|
|
|a Computer Science (SpringerNature-11645)
|
950 |
|
|
|a Computer Science (R0) (SpringerNature-43710)
|