|
|
|
|
|
|
|
|
1. |
Record Nr. |
UNISA996465409103316 |
|
|
Titolo |
Automata, languages and programming : 2nd Colloquium, University of Saarbrücken, July 29 - August 2, 1974 / / edited by J. Loeckx |
|
|
|
|
|
|
|
Pubbl/distr/stampa |
|
|
Berlin ; ; Heidelberg ; ; New York : , : Springer-Verlag Berlin Heidelberg GmbH, , [1974] |
|
©1974 |
|
|
|
|
|
|
|
|
|
ISBN |
|
3-540-37778-6 |
3-662-21545-4 |
|
|
|
|
|
|
|
|
Edizione |
[1st ed. 1974.] |
|
|
|
|
|
Descrizione fisica |
|
1 online resource (619 p.) |
|
|
|
|
|
|
Collana |
|
Lecture notes in computer science ; ; 14 |
|
|
|
|
|
|
Disciplina |
|
|
|
|
|
|
Soggetti |
|
Sequential machine theory |
|
|
|
|
|
|
Lingua di pubblicazione |
|
|
|
|
|
|
Formato |
Materiale a stampa |
|
|
|
|
|
Livello bibliografico |
Monografia |
|
|
|
|
|
Note generali |
|
Bibliographic Level Mode of Issuance: Monograph |
|
|
|
|
|
|
Nota di contenuto |
|
The 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 |
|
|
|
|