04463nam 22005895 450 99646530640331620200707021746.03-540-35807-210.1007/3-540-08860-1(CKB)1000000000229899(SSID)ssj0000321505(PQKBManifestationID)11241026(PQKBTitleCode)TC0000321505(PQKBWorkID)10263966(PQKB)11482126(DE-He213)978-3-540-35807-7(PPN)155172719(EXLCZ)99100000000022989920121227d1978 u| 0engurnn|008mamaatxtccrAutomata, Languages and Programming[electronic resource] Fifth Colloquium, Udine, Italy, July 17 - 21, 1978. Proceedings /edited by G. Ausiello, C. Böhm1st ed. 1978.Berlin, Heidelberg :Springer Berlin Heidelberg :Imprint: Springer,1978.1 online resource (X, 510 p.) Lecture Notes in Computer Science,0302-9743 ;62Bibliographic Level Mode of Issuance: Monograph3-540-08860-1 Simple 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.Lecture Notes in Computer Science,0302-9743 ;62Mathematical logicComputer scienceComputersMathematical Logic and Foundationshttps://scigraph.springernature.com/ontologies/product-market-codes/M24005Computer Science, generalhttps://scigraph.springernature.com/ontologies/product-market-codes/I00001Theory of Computationhttps://scigraph.springernature.com/ontologies/product-market-codes/I16005Mathematical logic.Computer science.Computers.Mathematical Logic and Foundations.Computer Science, general.Theory of Computation.511.3Ausiello Gedthttp://id.loc.gov/vocabulary/relators/edtBöhm Cedthttp://id.loc.gov/vocabulary/relators/edtBOOK996465306403316Automata, languages and programming339738UNISA