%{search_type} search results

• On the structure of algorithmic problems
• A mathematical model of digital computers
• On some recent problems concerning developmental languages
• Fault-tolerance and stability of fuzzy-state automata
• Bemerkungen über Homomorphismen endlicher in lineare Automaten
• Der Kaskadenzerlegungssatz für Halbautomaten
• Konvergenzbetrachtungen bei der Vorhersage des Ausgabeverhaltens allgemeiner stochastischer Systeme
• Ketten und arithmetische Prädikate von endlichen Automaten
• Une hierarchie infinie de cones d'Accepteurs verificateurs
• Zustandsfolgenabbildungen von verallgemeinerten endlichen Automaten
• Ein automatentheoretisches Modell einer Speicherhierarchie
• Deterministic one-counter automata
• The use of metric and uniform spaces for the formalization of behavioral proximity of states
• Quelques generateurs des langages algebriques
• Une caracterisation des langages quasi-rationnels standards
• Der Einfluss von Kontext auf spezielle CF-Grammatiken
• Zur Komplexität gesteuerter kontextfreier Ersetzungen
• Characterization of derivation sets of formal systems
• Die Darstellung indizierter Sprachen durch Ausdrücke
• Codes and aperiodic languages
• The characterization of certain classes of languages in the context sensitive area by automata
• A characterization of boolean closures of families of languages
• Zufällige Folgen und Bi-Immunität
• Die mittler Additionsdauer eines Paralleladdierwerks
• On the number of multiplications required by the product of two matrices
• Elementare und subelementare Funktionenklassen über binären Bäumen
• Über die Vernetzungsstruktur von Maschinen
• On the simulation of time bounded machines
• Über die Zeit, die benötigt wird, um endliche Mengen umzuordnen
• Über eine Hierarchie von Push-Down-Entscheidbaren Mengen
• A characterization of the classes L1 and R1 of primitive recursive word functions
• A drum scheduling algorithm
• Some considerations about classes of mappings between context-free derivation systems
• On ianov schemas with one memory location
• Reduction goals in bottom-up recognition
• Un modele semantique pour un langage simple de programmation
• Erweiterungen subrekursiver Programmiersprachen.

• 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 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 cones rationnels.- Komplexitatsmasse 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.
• (source: Nielsen Book Data)

The Second Colloquium on Automata, Languages and Programming is the successor of a similar Colloquium organized by IRIA in Paris, July 3-7, 1972. The present Colloquium which takes place at the Unl-- versity of Saarbrucken from July 29th to August 2nd, 1974, is spon- sored by the Gesellschaft fur. Informatik and organized in cooperation wlth the Special Interest Group on Automata and Computability Theory (SIGACT) and with the European Association for Theoretical Computer Science (EATCS). As its predecessor the present Colloquium is devoted to the theo- retical bases of computer science. This volume contains the text of the different lectures of the Colloquium whlch have been selected by the Program Committee out of about 130 submitted papers. About one third of the papers of this volume is concerned with formal language theory, one other third with the theory of computation and the rest with complexity theory, automata theory, programming languages, etc.
(source: Nielsen Book Data)