000 03799nam a22004455i 4500
001 978-3-540-35807-7
003 DE-He213
005 20160624101932.0
007 cr nn 008mamaa
008 121227s1978 gw | s |||| 0|eng d
020 _a9783540358077
_9978-3-540-35807-7
024 7 _a10.1007/3-540-08860-1
_2doi
050 4 _aQA75.5-76.95
072 7 _aUY
_2bicssc
072 7 _aCOM014000
_2bisacsh
082 0 4 _a004
_223
245 1 0 _aAutomata, Languages and Programming
_h[electronic resource] :
_bFifth Colloquium, Udine, Italy, July 17–21, 1978 /
_cedited by Giorgio Ausiello, Corrado Böhm.
260 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c1978.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c1978.
300 _aX, 510 p.
_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 ;
_v62
505 0 _aSimple EOL forms under uniform interpretation generating CF languages -- Codes : Unequal probabilities, unequal letter costs -- Sur l'inversion des morphismes d'arbres -- Grammars with dynamic control sets -- Ambiguite forte -- Relationship between density and deterministic complexity of MP-complete languages -- Stable models of typed ?-calculi -- Path measures of turing machine computations -- Une famille remarquable de codes indecomposables -- Comparisons and reset machines -- Size — Depth tradeoff in boolean formulas -- (Semi)-separability of finite sets of terms in Scott's D?-models of the ?-calculus -- Mutual exclusion of N processors using an O(N)-valued message variable -- On the power of self-application and higher type recursion -- Time and space bounds for selection problems -- Stepwise specification and implementation of abstract data types -- The complexity of equivalence and containment for free single variable program schemes -- On improving the worst case running time of the Boyer-Moore string matching algorithm -- Semantics and correctness of nondeterministic flowchart programs with recursive procedures -- Arithmetical completeness in logics of programs -- Covering a graph by circuits -- A pspace complete problem related to a pebble game -- Some effective results about linear recursive sequences -- On the parsing and covering of simple chain grammars -- Sur un cas particulier de la conjecture de Cerny -- States can sometimes do more than stack symbols in PDA's -- Some decision results for recognizable sets in arbitrary monoids -- Sur les series rationnelles en variables non commutatives -- On constructing efficient evaluators for attribute grammars -- Une extension de la theorie des types en ?-calcul -- Parallel and nondeterministic time complexity classes -- Multiterminal network flow and connectivity in unsymmetrical networks -- Admissible coherent c.p.o.'s -- Integration of the phase-difference relations in asynchronous sequential networks -- Self-modifying nets, a natural extension of Petri nets -- Head recurrent terms in combinatory logic : A generalization of the notion of head normal form -- Characterization problems in the theory of inductive inference.
650 0 _aComputer science.
650 1 4 _aComputer Science.
650 2 4 _aComputer Science, general.
700 1 _aAusiello, Giorgio.
_eeditor.
700 1 _aBöhm, Corrado.
_eeditor.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9783540088608
786 _dSpringer
830 0 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v62
856 4 0 _uhttp://dx.doi.org/10.1007/3-540-08860-1
942 _2EBK4185
_cEBK
999 _c33479
_d33479