Del 705
Theoretical Computer Science
4th GI Conference Aachen, March 26-28, 1979
Häftad, Engelska, 1979
Del i serien Lecture Notes in Computer Science
256 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
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.
Hoppa över listan









Du kanske också är intresserad av
Del 703
Del 704
Del 28
Del 167
- Nyhet
- Nyhet
Hjärnans akilleshälar : hur din hjärna lurar dig, och vad du kan göra åt det
Anders Hansen
Inbunden
289 kr
- -30%
- Nyhet
- Signerad!
Del 11