Del i serien Lecture Notes in Computer Science
Theoretical Computer Science
4th GI Conference Aachen, March 26-28, 1979
349 kr
Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt för medlemmar vid köp för minst 249 kr.
Finns i fler format (10)
Produktinformation
- Utgivningsdatum1979-03-05
- Mått155 x 235 x 19 mm
- Vikt517 g
- FormatHäftad
- SpråkEngelska, Tyska
- SerieLecture Notes in Computer Science
- Antal sidor330
- Upplaga1979
- FörlagSpringer-Verlag Berlin and Heidelberg GmbH & Co. KG
- ISBN9783540091189
Tillhör följande kategorier
- 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.
Mer från samma serie
Agent Mediated Electronic Commerce II
Alexandros Moukas, Carles Sierra, Fredrik Ygge
Häftad, 2000
739 kr
Segmentation, Classification, and Synthesis for Brain Tumors and Traumatic Brain Injuries
Spyridon Bakas, Emily Dennis, Mehdi Astaraki, Ujjwal Baid, Gian Marco Conte, Martha Foltyn-Dumitru, Zhifan Jiang, Dominic Labella, Marie-Christin Metz, Udunna Anazodo, Maria Correia de Verdier, Florian Kofler, Hongwei Bran Li, Marius George Linguraru, Nazanin Maleki
Häftad, 2026
1 209 kr
Medical Image Computing and Computer Assisted Intervention – MICCAI 2024 Workshops
Anna Schroder, Xiang Li, Tanveer Syeda-Mahmood, Neil P. Oxtoby, Alexandra Young, Alessa Hering, Tejas S. Mathai, Pritam Mukherjee, Sven Kuckertz, Tiantian He, Isaac Llorente-Saguer, Andreas Maier, Satyananda Kashyap, Hayit Greenspan, Anant Madabhushi
Häftad, 2025
959 kr