| 000 | 03193nam a22004335i 4500 | ||
|---|---|---|---|
| 001 | 978-3-540-35517-5 | ||
| 003 | DE-He213 | ||
| 005 | 20160624101931.0 | ||
| 007 | cr nn 008mamaa | ||
| 008 | 121227s1979 gw | s |||| 0|eng d | ||
| 020 |
_a9783540355175 _9978-3-540-35517-5 |
||
| 024 | 7 |
_a10.1007/3-540-09118-1 _2doi |
|
| 050 | 4 | _aQA75.5-76.95 | |
| 072 | 7 |
_aUY _2bicssc |
|
| 072 | 7 |
_aCOM014000 _2bisacsh |
|
| 082 | 0 | 4 |
_a004 _223 |
| 245 | 1 | 0 |
_aTheoretical Computer Science 4th GI Conference _h[electronic resource] : _bAachen, March 26–28, 1979 / _cedited by K. Weihrauch. |
| 260 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c1979. |
|
| 264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c1979. |
|
| 300 |
_aVII, 330 p. _bonline resource. |
||
| 336 |
_atext _btxt _2rdacontent |
||
| 337 |
_acomputer _bc _2rdamedia |
||
| 338 |
_aonline resource _bcr _2rdacarrier |
||
| 347 |
_atext file _bPDF _2rda |
||
| 490 | 1 |
_aLecture Notes in Computer Science, _x0302-9743 ; _v67 |
|
| 505 | 0 | _aContext-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. | |
| 650 | 0 | _aComputer science. | |
| 650 | 1 | 4 | _aComputer Science. |
| 650 | 2 | 4 | _aComputer Science, general. |
| 700 | 1 |
_aWeihrauch, K. _eeditor. |
|
| 710 | 2 | _aSpringerLink (Online service) | |
| 773 | 0 | _tSpringer eBooks | |
| 776 | 0 | 8 |
_iPrinted edition: _z9783540091189 |
| 786 | _dSpringer | ||
| 830 | 0 |
_aLecture Notes in Computer Science, _x0302-9743 ; _v67 |
|
| 856 | 4 | 0 | _uhttp://dx.doi.org/10.1007/3-540-09118-1 |
| 942 |
_2EBK4169 _cEBK |
||
| 999 |
_c33463 _d33463 |
||