LEADER 00722nam0-22002531i-450- 001 990007319150403321 005 20021010 035 $a000731915 035 $aFED01000731915 035 $a(Aleph)000731915FED01 035 $a000731915 100 $a20021010d--------km-y0itay50------ba 101 0 $aita 200 1 $a" Questnay - la costruzione della macchina della prosperità "$fGilibert 210 $aMilano$cs.e.$d1977 700 1$aGilbert,$bG.$0354950 801 0$aIT$bUNINA$gRICA$2UNIMARC 901 $aBK 912 $a990007319150403321 951 $aXV F1 10$b1955$c$dXV F1 10 959 $aDTE 996 $a" Questnay - la costruzione della macchina della prosperità "$9695761 997 $aUNINA DB $aGEN01 LEADER 04437nam 22005415 450 001 996465661403316 005 20200707021954.0 010 $a3-540-37305-5 024 7 $a10.1007/3-540-08342-1 035 $a(CKB)1000000000229844 035 $a(SSID)ssj0000321515 035 $a(PQKBManifestationID)11227084 035 $a(PQKBTitleCode)TC0000321515 035 $a(PQKBWorkID)10279583 035 $a(PQKB)10909017 035 $a(DE-He213)978-3-540-37305-6 035 $a(PPN)155234722 035 $a(EXLCZ)991000000000229844 100 $a20121227d1977 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aAutomata, Languages and Programming$b[electronic resource] $eFourth Colloquium, University of Turku, Finnland, July 18-22, 1977 /$fedited by A. Salomaa, M. Steinby 205 $a1st ed. 1977. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d1977. 215 $a1 online resource (XII, 572 p.) 225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v52 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-08342-1 327 $aHow hard is compiler code generation? -- "Natural" complexity measures and time versus memory: Some definitional proposals -- Semantics and proof theory of pascal procedures -- On the structure of combinatorial problems and structure preserving reductions -- Factor graphs, failure functions and Bi-Trees -- Parallel decomposition of LR(k) parsers -- Some recursively unsolvable problems relating to isolated cutpoints in probabilistic automata -- Termination tests inside ?-calculus -- On the computational power of reversal-bounded machines -- The contextsensitivity bounds of contextsensitive grammars and languages -- Serial composition of 2-way finite-state transducers and simple programs on strings -- The sequence equivalence problem for dol systems is decidable -- Languages defined by higher type program schemes -- Parsing and syntactic error recovery for context-free grammars by means of coarse structures -- On three types of unambiguity of context-free language -- The mathematics of record handling -- Macro grammars, lindenmayer systems and other copying devices -- On the time and tape complexity of hyper(1)-AFL's -- Renaming and erasing in szilard languages -- Some matching problems -- Complexite des demi ? Groupes de matrices -- On the proper treatment or referencing, dereferencing and assignment -- Complexity of some problems concerning L systems -- Left-fitting translations -- Dynamic binary search -- About the derivation languages of grammars and machines -- Simple chain grammars -- Time-space trade-offs in a pebble game -- Non-deterministic polynomial optimization problems and their approximation -- Simple programs and their decision problems -- Theory of data structures by relational and graph grammars -- On backtracking and greatest fixpoints -- L systems of finite index -- The safety of a coroutine system -- Linear time simulation of multihead turing machines with head ? To-head jumps -- Data types as objects -- On the difference between one and many -- On defining error recovery in context-free parsing -- LL(k) languages are closed under union with finite languages -- The time and tape complexity of developmental languages -- Rational relations of binary trees -- Structural equivalence of context-free grammar forms is decidable -- On the definition of classes of interpretations. 410 0$aLecture Notes in Computer Science,$x0302-9743 ;$v52 606 $aComputers 606 $aProgramming languages (Electronic computers) 606 $aTheory of Computation$3https://scigraph.springernature.com/ontologies/product-market-codes/I16005 606 $aProgramming Languages, Compilers, Interpreters$3https://scigraph.springernature.com/ontologies/product-market-codes/I14037 615 0$aComputers. 615 0$aProgramming languages (Electronic computers). 615 14$aTheory of Computation. 615 24$aProgramming Languages, Compilers, Interpreters. 676 $a004.0151 702 $aSalomaa$b A$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aSteinby$b M$4edt$4http://id.loc.gov/vocabulary/relators/edt 906 $aBOOK 912 $a996465661403316 996 $aAutomata, languages and programming$9339738 997 $aUNISA LEADER 01119nam a2200301 i 4500 001 991000145969707536 008 031201s1988 enk b 001 0 eng d 020 $a086078231X 035 $ab12576402-39ule_inst 040 $aISUFI - Sett. Diritti e Politiche Euromediterranee$bita 041 0 $aengger 082 0 $a340.5/5$220 100 1 $aUllmann, Walter$0161909 245 10$aLaw and jurisdiction in the Middle Ages /$cWalter Ullmann ; edited by George Garnett 260 $aLondon :$bVariorum Reprints,$cc1988 300 $a1 v. (various pagings) ;$c23 cm 490 1 $aVariorum reprint. CS ;$v283 504 $aBibliografia 650 4$aDiritto romano$xStoria 650 4$aDiritto medioevale$xStoria 700 1 $aGarnett, George 830 0$aCollected studies;$vCS283 907 $a.b12576402$b20-04-22$c01-12-03 912 $a991000145969707536 945 $aLE029 340 ULL01.01$g1$i2029000005370$lle029$op$pE107.69$q-$rn$so $t0$u0$v0$w0$x0$y.i1303540x$z01-12-03 996 $aLaw and jurisdiction in the Middle Ages$9254189 997 $aUNISALENTO 998 $ale029$b01-12-03$cm$da $e-$feng$genk$h0$i1