Theoretical Computer Science

4th GI Conference Aachen, March 26-28, 1979

AvK. Weihrauch

Häftad, Engelska, 1979

Del i serien Lecture Notes in Computer Science

267 kr

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

Produktinformation

Utgivningsdatum:1979-03-05
Mått:155 x 235 x 19 mm
Vikt:517 g
Format:Häftad
Språk:Engelska, Tyska
Serie:Lecture Notes in Computer Science
Antal sidor:330
Upplaga:1979
Förlag:Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
ISBN:9783540091189

Utforska kategorier

Systemvetenskap och AI inom Data och IT

Innehållsförteckning

Context-free sets of infinite words.- New aspects of homomorphisms.- Can partial correctness assertions specify programming language semantics?.- An algebraic theory for synchronization.- Storage modification machines.- Negative results on counting.- Strong non-deterministic context-free languages.- Information content characterizations of complexity theoretic properties.- Mittlere Anzahl von Rebalancierungsoperationen in gewichtsbalancierten Bäumen.- A new recursion induction principle.- Finite-change automata.- Move rules and trade-offs in the pebble game.- Transition diagrams and strict deterministic grammars.- Exact expressions for some randomness tests.- On storage optimization for automatically generated compilers.- On continuous completions.- A new method to show lower bounds for polynomials which are hard to compute.- On zerotesting-bounded multicounter machines.- When are two effectively given domains identical?.- Sur deux langages linéaires.- An efficient on-line position tree construction algorithm.- Sorting presorted files.- Node-visit optimal 1 – 2 brother trees.- A graph theoretic approach to determinism versus non-determinism.- Une caracterisation de trois varietes de langages bien connues.- Über eine minimale universelle Turing-Maschine.- Sur les varietes de langages et de monoïdes.- Automaten in planaren graphen.- Theoreme de transversale rationnelle pour les automates a pile deterministes.- On the additive complexity of polynomials and some new lower bounds.- Remarks on the nonexistence of some covering grammars.- Zur Komplexität der Presburger Arithmetik und des Äquivalenzproblems einfacher Programme.

Du kanske också är intresserad av

Nyhet

L’amour toujours : Berättelsen om Tidö

Maggie Strömberg, Torbjörn Nilsson

Inbunden, 2026

275 kr

Del 705

Konstruktion verseller Familien kompakter komplexer Räume

Otto Forster, Knut Knorr

Häftad, 1979

212 kr

Six Answers to the Problem of Taste

Ronald Suter

Inbunden, 1979

237 kr

Del 703

Equadiff IV

J. Fabera

Häftad, 1979

500 kr

R. Glowinski, J.L. Lions - Computing Methods in Applied Sciences and Engineering, 1977. Third International Symposium, December 5-9, 1977, IRIA LABORIA, Institut de Recherche d`Informatique et d`Automatique, Häftad

Del 704

Computing Methods in Applied Sciences and Engineering, 1977. Third International Symposium, December 5-9, 1977, IRIA LABORIA, Institut de Recherche d`Informatique et d`Automatique

R. Glowinski, J.L. Lions

Häftad, 1979

391 kr

-21%

Ha en nice dag

Mikael Yvesand

Inbunden, 2026

189 kr239 kr

Del 28

Mathematical Aspects of Reacting and Diffusing Systems

P. C. Fife

Häftad, 1979

556 kr

Del 167

Introduction to Modern Austrian Capital Theory

Malte Faber

Häftad, 1979

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

Theoretical Computer Science

4th GI Conference Aachen, March 26-28, 1979

AvK. Weihrauch

Häftad, Engelska, 1979

Del i serien Lecture Notes in Computer Science

267 kr

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

Produktinformation

Utgivningsdatum:1979-03-05
Mått:155 x 235 x 19 mm
Vikt:517 g
Format:Häftad
Språk:Engelska, Tyska
Serie:Lecture Notes in Computer Science
Antal sidor:330
Upplaga:1979
Förlag:Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
ISBN:9783540091189

Utforska kategorier

Systemvetenskap och AI inom Data och IT

Innehållsförteckning

Context-free sets of infinite words.- New aspects of homomorphisms.- Can partial correctness assertions specify programming language semantics?.- An algebraic theory for synchronization.- Storage modification machines.- Negative results on counting.- Strong non-deterministic context-free languages.- Information content characterizations of complexity theoretic properties.- Mittlere Anzahl von Rebalancierungsoperationen in gewichtsbalancierten Bäumen.- A new recursion induction principle.- Finite-change automata.- Move rules and trade-offs in the pebble game.- Transition diagrams and strict deterministic grammars.- Exact expressions for some randomness tests.- On storage optimization for automatically generated compilers.- On continuous completions.- A new method to show lower bounds for polynomials which are hard to compute.- On zerotesting-bounded multicounter machines.- When are two effectively given domains identical?.- Sur deux langages linéaires.- An efficient on-line position tree construction algorithm.- Sorting presorted files.- Node-visit optimal 1 – 2 brother trees.- A graph theoretic approach to determinism versus non-determinism.- Une caracterisation de trois varietes de langages bien connues.- Über eine minimale universelle Turing-Maschine.- Sur les varietes de langages et de monoïdes.- Automaten in planaren graphen.- Theoreme de transversale rationnelle pour les automates a pile deterministes.- On the additive complexity of polynomials and some new lower bounds.- Remarks on the nonexistence of some covering grammars.- Zur Komplexität der Presburger Arithmetik und des Äquivalenzproblems einfacher Programme.