Automata theory and formal languages : 2nd GI conference, Kaiserslautern, May 20-23, 1975
Author(s)
Bibliographic Information
Automata theory and formal languages : 2nd GI conference, Kaiserslautern, May 20-23, 1975
(Lecture notes in computer science, 33)
Springer-Verlag, 1975
- : gw
- : us
Available at / 53 libraries
-
Kobe University Library for Science and Technology
: us417-408-15031020083177,
548-0-6//331008805932 -
University of Tsukuba Library, Library on Library and Information Science
: gw007.08:L-49:33881003180
-
No Libraries matched.
- Remove all filters.
Note
English or German
Includes bibliographies
Description and Table of Contents
Table of Contents
Formal language theory and theoretical computer science.- Le cylindre des langages lineaires n'est pas principal.- Langages algebriques deterministes et groupes abeliens.- Best possible bounds on the weighted path length of optimum binary search trees.- En?En?1-entscheidbare Gruppen.- Statistical characterization of learnable sequences.- Uber den mittleren Zeitbedarf bei der LR(k) - Analyse kontextfreier Sprachen.- Zur endlichen Approximierbarkeit sequentieller Systeme.- The complexity of negation-limited networks - A brief survey.- The network-complexity of equivalence and other applications of the network complexity.- Test d'isomorphie d'hypergraphes planaires.- Obere und untere Schranke fur die Komplexitat von Booleschen Funktionen.- On the entropy of a formal language.- On the complexity of computations under varying sets of primitives.- About the deterministic simulation of nondeterministic (log n)-tape bounded turing machines.- Zur Entscheidbarkeit der funktionalen Aquivalenz.- Quantifier elimination for real closed fields by cylindrical algebraic decompostion.- Deterministische indizierte Grammatiken.- Eine Beschreibung contextfreier Sprachen durch endliche Mengensysteme.- On the generative capacity of the strict global grammars.- Tree-transducers and syntax-connected transductions.- Sur les relations rationnelles.- Piecewise testable events.- Die Grosse des zustandsminimalen LR(O)-Analysators.- Formal translations and the containment problem for Szilard languages.- A characterization of bounded regular sets.- Eine universelle Lambda-Kalkul-Programmiersprache und ihr Interpreter.- Potenzkategorien und ihre Anwendung auf den Beweis von Programmeigenschaften.- Welcher Art Ergebnisse erwartet der Compilerbau von der Theoretischen Informatik?.- Pradikatives Programmieren.- Analyzing families of grammars.- Control structures and monadic languages.
by "Nielsen BookData"