LEADER 04745nam 2200613 450 001 996465409103316 005 20230725033328.0 010 $a3-540-37778-6 010 $a3-662-21545-4 024 7 $a10.1007/3-540-06841-4 035 $a(CKB)1000000000229705 035 $a(SSID)ssj0000321510 035 $a(PQKBManifestationID)11260293 035 $a(PQKBTitleCode)TC0000321510 035 $a(PQKBWorkID)10263967 035 $a(PQKB)11194218 035 $a(DE-He213)978-3-540-37778-8 035 $a(DE-He213)978-3-662-21545-6 035 $a(MiAaPQ)EBC5586257 035 $a(MiAaPQ)EBC6595832 035 $a(Au-PeEL)EBL5586257 035 $a(OCoLC)1066195213 035 $a(Au-PeEL)EBL6595832 035 $a(OCoLC)1164871865 035 $a(PPN)155191403 035 $a(EXLCZ)991000000000229705 100 $a20220113d1974 uy 0 101 0 $aeng 135 $aurnn#008mamaa 181 $ctxt 182 $cc 183 $acr 200 00$aAutomata, languages and programming $e2nd Colloquium, University of Saarbrücken, July 29 - August 2, 1974 /$fedited by J. Loeckx 205 $a1st ed. 1974. 210 1$aBerlin ;$aHeidelberg ;$aNew York :$cSpringer-Verlag Berlin Heidelberg GmbH,$d[1974] 210 4$d©1974 215 $a1 online resource (619 p.) 225 1 $aLecture notes in computer science ;$v14 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-06863-5 311 $a3-540-06841-4 327 $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. 410 0$aLecture notes in computer science ;$v14. 606 $aSequential machine theory$vCongresses 615 0$aSequential machine theory 676 $a511.3 702 $aLoeckx$b Jacques$f1931- 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a996465409103316 996 $aAutomata, languages and programming$9339738 997 $aUNISA