Automata Theory and Formal Languages: 2nd GI Conference, Kaiserslautern, May 20-23, 1975 by H. BrakhageAutomata Theory and Formal Languages: 2nd GI Conference, Kaiserslautern, May 20-23, 1975 by H. Brakhage

Automata Theory and Formal Languages: 2nd GI Conference, Kaiserslautern, May 20-23, 1975

EditorH. Brakhage

Paperback | September 1, 1975

Pricing and Purchase Info

$48.04 online 
$51.95 list price save 7%
Earn 240 plum® points

Prices and offers may vary in store

Quantity:

In stock online

Ships free on orders over $25

Not available in stores

Title:Automata Theory and Formal Languages: 2nd GI Conference, Kaiserslautern, May 20-23, 1975Format:PaperbackDimensions:292 pages, 9.25 × 6.1 × 0.07 inPublished:September 1, 1975Publisher:Springer Berlin HeidelbergLanguage:English

The following ISBNs are associated with this title:

ISBN - 10:3540074074

ISBN - 13:9783540074076

Look for similar items by category:

Reviews

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.- Über 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 für die Komplexität 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 Äquivalenz.- 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 Grösse des zustandsminimalen LR(O)-Analysators.- Formal translations and the containment problem for Szilard languages.- A characterization of bounded regular sets.- Eine universelle Lambda-Kalkül-Programmiersprache und ihr Interpreter.- Potenzkategorien und ihre Anwendung auf den Beweis von Programmeigenschaften.- Welcher Art Ergebnisse erwartet der Compilerbau von der Theoretischen Informatik?.- Prädikatives Programmieren.- Analyzing families of grammars.- Control structures and monadic languages.