Automata, Languages and Programming

Fifth Colloquium, Udine, Italy, July 17 - 21, 1978. Proceedings

AvG. Ausiello,C. Böhm

Häftad, Engelska, 1978

Del i serien Lecture Notes in Computer Science

556 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt över 249 kr.

Produktinformation

Utgivningsdatum:1978-07-01
Mått:155 x 235 x 28 mm
Vikt:779 g
Format:Häftad
Språk:Engelska, Franska
Serie:Lecture Notes in Computer Science
Antal sidor:510
Upplaga:1978
Förlag:Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
ISBN:9783540088608

Utforska kategorier

Innehållsförteckning

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.- Multiterminalnetwork 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.

Du kanske också är intresserad av

Nyhet

L’amour toujours : Berättelsen om Tidö

Maggie Strömberg, Torbjörn Nilsson

Inbunden, 2026

275 kr

CAAP '81

E. Astesiano, C. Böhm

Häftad, 1981

556 kr

λ-Calculus and Computer Science Theory

C. Böhm

Häftad, 1975

556 kr

Analysis and Design of Algorithms for Combinatorial Problems

M. Lucertini, G. Ausiello

E-bok

1985

702 kr

CAAP '83

G. Ausiello, M. Protasi

Häftad, 1983

572 kr

Signerad!

SIGNERAD - Om julens wälgång

Klara Peters Bastin

Inbunden, 2026

249 kr

Ruth Kvarnström-Jones - SIGNERAD - Systrarna på Sophiahemmet, Inbunden

Signerad!

Del 3

SIGNERAD - Systrarna på Sophiahemmet

Ruth Kvarnström-Jones

Inbunden, 2026

249 kr

Den som följer en stjärna vänder inte om

Malin Haawind

Pocket, 2025

(70)

99 kr

-21%

Ha en nice dag

Mikael Yvesand

Inbunden, 2026

189 kr239 kr

Nyhet

Del 11

Medusa

Lars Kepler

Inbunden, 2026

269 kr

Automata, Languages and Programming

Fifth Colloquium, Udine, Italy, July 17 - 21, 1978. Proceedings

AvG. Ausiello,C. Böhm

Häftad, Engelska, 1978

Del i serien Lecture Notes in Computer Science

556 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt över 249 kr.

Produktinformation

Utgivningsdatum:1978-07-01
Mått:155 x 235 x 28 mm
Vikt:779 g
Format:Häftad
Språk:Engelska, Franska
Serie:Lecture Notes in Computer Science
Antal sidor:510
Upplaga:1978
Förlag:Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
ISBN:9783540088608

Utforska kategorier

Innehållsförteckning

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.- Multiterminalnetwork 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.