000 | 04429nam a22004335i 4500 | ||
---|---|---|---|
001 | 978-3-662-21545-6 | ||
003 | DE-He213 | ||
005 | 20160624102237.0 | ||
007 | cr nn 008mamaa | ||
008 | 131207s1974 gw | s |||| 0|eng d | ||
020 |
_a9783662215456 _9978-3-662-21545-6 |
||
024 | 7 |
_a10.1007/978-3-662-21545-6 _2doi |
|
050 | 4 | _aQA75.5-76.95 | |
072 | 7 |
_aUY _2bicssc |
|
072 | 7 |
_aCOM014000 _2bisacsh |
|
082 | 0 | 4 |
_a004 _223 |
245 | 1 | 0 |
_aAutomata, Languages and Programming _h[electronic resource] : _b2nd Colloquium, University of Saarbrücken July 29–August 2, 1974 / _cedited by Jacques Loeckx. |
260 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg : _bImprint: Springer, _c1974. |
|
264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg : _bImprint: Springer, _c1974. |
|
300 |
_a619 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 ; _v14 |
|
505 | 0 | _aThe generative power of two-level grammars -- A generalisation of Parikh's theorem in formal language theory -- Checking stacks and context-free programmed grammars accept p-complete languages -- Recursion and parameter mechanisms: An axiomatic approach -- Dynamic programming schemata -- Semantic characterization of flow diagrams and their decomposability -- On the most recent property of ALGOL-like programs -- Langages sans etiquettes et transformations de programmes -- Relations between semantics and complexity of recursive programs- -- On the relation between direct and continuation semantics -- Graph representation and computation rules for typeless recursive languages -- Application of Church-Rosser properties to increase the parallelism and efficiency of algorithms -- Combinatorial problems, combinator equations and normal forms -- Algorithmes d'Equivalence et de reduction a des expressions minimales dans une classe d'equations recursives simples -- Automatic generation of multiple exit parsing subroutines -- Production prefix parsing -- On eliminating unit productions from LR(k) parsers -- Deterministic techniques for efficient non-deterministic parsers -- File organization, an application of graph theory -- Characterizations of time-bounded computations by limited primitive recursion -- On maximal merging of information in Boolean computations -- On simple Goedel numberings and translations -- The ‘almost all’ theory of subrecursive degrees is decidable -- The computational complexity of program schemata -- Un resultat en theorie des groupes de permutations et son application au calcul effectif du groupe d'automorphismes d'un automate fini -- Sur l'Application du theoreme de suschkewitsch a l'etude des codes rationnels complets -- Composition of automata -- Context-free grammar forms -- Une suite decroissante de cônes rationnels -- Komplexitätsmaße for Ausdrocke -- Efficient procedures for using matrix algorithms -- Further schemes for combining matrix algorithms -- On the structure of complexity classes -- On sets having only hard subsets -- Turing machines with associative memory access -- Trade-off between the use of nonterminals, codings and homomorphisms in defining languages for some classes of rewriting systems -- Operators reducing generalized OL-systems -- Parallel rewriting systems on terms -- Transductions of context-free languages into sets of sentential forms -- Parallelism in rewriting systems -- Mehrdeutigkeiten kontextfreier Grammatiken -- Monadic program schemes under restricted classes of free interpretations -- Generalized program schemas -- A decidability result for sequential grammars -- Effectivity problems of algorithmic logic -- Simple and structural redundancy in non-deterministic computation -- Sur une propriete syntactique des relations rationnelles. | |
650 | 0 | _aComputer science. | |
650 | 1 | 4 | _aComputer Science. |
650 | 2 | 4 | _aComputer Science, general. |
700 | 1 |
_aLoeckx, Jacques. _eeditor. |
|
710 | 2 | _aSpringerLink (Online service) | |
773 | 0 | _tSpringer eBooks | |
776 | 0 | 8 |
_iPrinted edition: _z9783540068419 |
786 | _dSpringer | ||
830 | 0 |
_aLecture Notes in Computer Science, _x0302-9743 ; _v14 |
|
856 | 4 | 0 | _uhttp://dx.doi.org/10.1007/978-3-662-21545-6 |
942 |
_2EBK11234 _cEBK |
||
999 |
_c40528 _d40528 |