1978, ISBN: 3540088601

[EAN: 9783540088608], Neubuch, [PU: Springer Berlin Heidelberg], INFORMATIK; DATENVERARBEITUNG; FORMALE SPRACHE; ALGORITHMS; CALCULUS; COMPLEXITY, Druck auf Anfrage Neuware - Printed afte… Mehr…

[EAN: 9783540088608], Neubuch, [PU: Springer Berlin Heidelberg], INFORMATIK; DATENVERARBEITUNG; FORMALE SPRACHE; ALGORITHMS; CALCULUS; COMPLEXITY, Druck auf Anfrage Neuware - Printed after ordering - 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., Books<

1978, ISBN: 3540088601

[EAN: 9783540088608], Neubuch, [PU: Springer Berlin Heidelberg Jul 1978], INFORMATIK; DATENVERARBEITUNG; FORMALESPRACHE; ALGORITHMS; CALCULUS; COMPLEXITY, This item is printed on demand -… Mehr…

[EAN: 9783540088608], Neubuch, [PU: Springer Berlin Heidelberg Jul 1978], INFORMATIK; DATENVERARBEITUNG; FORMALESPRACHE; ALGORITHMS; CALCULUS; COMPLEXITY, This item is printed on demand - it takes 3-4 days longer - Neuware -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. 520 pp. Englisch, Französisch, Books<

2001, ISBN: 9783540088608

[ED: Taschenbuch], [PU: Springer Berlin Heidelberg], Neuware - Simple EOL forms under uniform interpretation generating CF languages.- Codes : Unequal probabilities, unequal letter costs.… Mehr…

[ED: Taschenbuch], [PU: Springer Berlin Heidelberg], Neuware - 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., DE, [SC: 0.00], Neuware, gewerbliches Angebot, 235x155x28 mm, 520, [GW: 779g], Banküberweisung, PayPal, Internationaler Versand<