Research Catalog
Automata theory and formal languages : 2nd GI conference, Kaiserslautern, May 20-23, 1975
- Title
- Automata theory and formal languages : 2nd GI conference, Kaiserslautern, May 20-23, 1975 / edited by H. Brakhage on behalf of GI.
- Publication
- Berlin ; New York : Springer-Verlag, 1975.
Items in the Library & Off-site
Filter by
1 Item
Status | Format | Access | Call Number | Item Location |
---|---|---|---|---|
Text | Use in library | QA267.A924 | Off-site |
Details
- Additional Authors
- Description
- viii, 292 pages : illustrations; 25 cm
- Series Statement
- Lecture notes in computer science ; 33
- Uniform Title
- Lecture notes in computer science ; 33.
- Subject
- Genre/Form
- Conference papers and proceedings
- Kongress.
- Note
- English or German.
- Bibliography (note)
- Includes bibliographies.
- 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.
- ISBN
- 0387074074
- 9780387074078
- 3540074074
- 9783540074076
- LCCN
- 75028494
- OCLC
- ocm01659581
- 1659581
- SCSB-9176661
- Owning Institutions
- Princeton University Library