| 000 | 03096nam a22006015i 4500 | ||
|---|---|---|---|
| 001 | 978-3-642-11881-4 | ||
| 003 | DE-He213 | ||
| 005 | 20240730201330.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 | _aTA347.A78 | |
| 072 | 7 |
_aUYQ _2bicssc |
|
| 072 | 7 |
_aCOM004000 _2bisacsh |
|
| 072 | 7 |
_aUYQ _2thema |
|
| 082 | 0 | 4 |
_a006.3 _223 |
| 100 | 1 |
_aPuppis, Gabriele. _eauthor. _4aut _4http://id.loc.gov/vocabulary/relators/aut _9166731 |
|
| 245 | 1 | 0 |
_aAutomata for Branching and Layered Temporal Structures _h[electronic resource] : _bAn Investigation into Regularities of Infinite Transition Systems / _cby Gabriele Puppis. |
| 250 | _a1st ed. 2010. | ||
| 264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg : _bImprint: Springer, _c2010. |
|
| 300 |
_a206 p. 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 Artificial Intelligence, _x2945-9141 ; _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 |
_aArtificial intelligence. _93407 |
|
| 650 | 0 |
_aSoftware engineering. _94138 |
|
| 650 | 0 |
_aCompilers (Computer programs). _93350 |
|
| 650 | 0 |
_aComputer science. _99832 |
|
| 650 | 0 |
_aMachine theory. _9166732 |
|
| 650 | 1 | 4 |
_aArtificial Intelligence. _93407 |
| 650 | 2 | 4 |
_aSoftware Engineering. _94138 |
| 650 | 2 | 4 |
_aCompilers and Interpreters. _931853 |
| 650 | 2 | 4 |
_aComputer Science Logic and Foundations of Programming. _942203 |
| 650 | 2 | 4 |
_aFormal Languages and Automata Theory. _9166733 |
| 710 | 2 |
_aSpringerLink (Online service) _9166734 |
|
| 773 | 0 | _tSpringer Nature eBook | |
| 776 | 0 | 8 |
_iPrinted edition: _z9783642118807 |
| 776 | 0 | 8 |
_iPrinted edition: _z9783642118821 |
| 830 | 0 |
_aLecture Notes in Artificial Intelligence, _x2945-9141 ; _v5955 _9166735 |
|
| 856 | 4 | 0 | _uhttps://doi.org/10.1007/978-3-642-11881-4 |
| 912 | _aZDB-2-SCS | ||
| 912 | _aZDB-2-SXCS | ||
| 912 | _aZDB-2-LNC | ||
| 942 | _cELN | ||
| 999 |
_c96471 _d96471 |
||