Overview

Full Product Details

Author:   H. Brakhage
Publisher:   Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
Imprint:   Springer-Verlag Berlin and Heidelberg GmbH & Co. K
Edition:   1975 ed.
Volume:   33
Dimensions:   Width: 21.60cm , Height: 1.60cm , Length: 27.90cm
Weight:   0.950kg
ISBN:  

9783540074076

ISBN 10:   3540074074
Pages:   292
Publication Date:   01 September 1975
Audience:   Professional and scholarly ,  Professional & Vocational
Format:   Paperback
Publisher's Status:   Active
Availability:   In Print  
This item will be ordered in for you from one of our suppliers. Upon receipt, we will promptly dispatch it out to you. For in store availability, please contact us.
Language:   English, German, French

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.

Reviews

Author Information

Tab Content 6

Author Website:  

Countries Available

All regions