Login / Signup
Automata Theory and Formal Languages
1975
1975
1975
Keyphrases
Publications
1975
Eberhard Bertsch
Analyzing families of grammars.
Automata Theory and Formal Languages
(1975)
Marcel Paul Schützenberger
Sur les relations rationnelles.
Automata Theory and Formal Languages
(1975)
Max Fontet
Test d'isomorphie d'hypergraphes planaires.
Automata Theory and Formal Languages
(1975)
Hans Langmaack
Hauptvortrag: Welcher Art Ergebnisse erwartet der Compilerbau von der Theoretischen Informatik?
Automata Theory and Formal Languages
(1975)
Kurt Mehlhorn
Best possible bounds for the weighted path length of optimum binary search trees.
Automata Theory and Formal Languages
(1975)
Hans-Peter Kriegel
,
Hermann A. Maurer
Formal translations and the containment problem for Szilard languages.
Automata Theory and Formal Languages
(1975)
George E. Collins
Hauptvortrag: Quantifier elimination for real closed fields by cylindrical algebraic decomposition.
Automata Theory and Formal Languages
(1975)
Jean-François Perrot
,
Jacques Sakarovitch
Langages algébriques déterministes et groupes abeliens.
Automata Theory and Formal Languages
(1975)
Rüdiger Valk
Zur endlichen Approximierbarkeit sequentieller Systeme.
Automata Theory and Formal Languages
(1975)
Claus-Peter Schnorr
The network-complexity of equivalence and other applications of the network complexity.
Automata Theory and Formal Languages
(1975)
Manfred Opp
Eine Beschreibung contextfreier Sprachen durch endliche Mengensysteme.
Automata Theory and Formal Languages
(1975)
Rainer Kemp
Die Größe des zustandsminimalen LR(0)-Analysators.
Automata Theory and Formal Languages
(1975)
David P. Dobkin
,
Richard J. Lipton
On the complexity of computations under varying sets of primitives.
Automata Theory and Formal Languages
(1975)
Burkhard Monien
About the deterministic simulation of nondeterministic (log n)-tape bounded Turing machines.
Automata Theory and Formal Languages
(1975)
Wolfgang Bibel
Prädikatives Programmieren.
Automata Theory and Formal Languages
(1975)
Luc Boasson
,
Maurice Nivat
Le cylindre des langages linéaires n'est pas principal.
Automata Theory and Formal Languages
(1975)
Peter Paul Schreiber
Tree-transducers and syntax-connected transductions.
Automata Theory and Formal Languages
(1975)
Aldo de Luca
On the entropy of a formal language.
Automata Theory and Formal Languages
(1975)
Sorin Ciobotaru
,
Gheorghe Paun
On the generative capacity of the strict global grammars.
Automata Theory and Formal Languages
(1975)
Jürgen Avenhaus
,
Klaus Madlener
-entscheidbare Gruppen.
Automata Theory and Formal Languages
(1975)
Heinrich Beck
Zur Entscheidbarkeit der funktionalen Äquivalenz.
Automata Theory and Formal Languages
(1975)
Herbert Klaeren
Potenzkaegorien und ihre Anwendung auf den Beweis von Programmeigenschaften.
Automata Theory and Formal Languages
(1975)
Klaus Indermark
Control structures and monadic languages.
Automata Theory and Formal Languages
(1975)
Elfriede Fehr
Eine universelle Lambda-Kalkül-Programmiersprache und ihr Interpreter.
Automata Theory and Formal Languages
(1975)
Antonio Restivo
A characterization of bounded regular sets.
Automata Theory and Formal Languages
(1975)
P. H. Fuchs
Statistical characterization of learnable sequences.
Automata Theory and Formal Languages
(1975)
Herbert Kopp
Über den mittleren Zeitbedarf bei der LR(k)-Analyse kontextfreier Sprachen.
Automata Theory and Formal Languages
(1975)
Ronald V. Book
Hauptvortrag: Formal language theory and theoretical computer science.
Automata Theory and Formal Languages
(1975)
Hanke Bremer
Obere und untere Schranke für die Komplexität von Booleschen Funktionen.
Automata Theory and Formal Languages
(1975)
Karl Weiß
Deterministische indizierte Grammatiken.
Automata Theory and Formal Languages
(1975)
Michael J. Fischer
Hauptvortrag: The complexity of negation-limited networks - A brief survey.
Automata Theory and Formal Languages
(1975)
Imre Simon
Piecewise testable events.
Automata Theory and Formal Languages
(1975)
volume 33, 1975
Automata Theory and Formal Languages, 2nd GI Conference, Kaiserslautern, May 20-23, 1975
Automata Theory and Formal Languages
33 (1975)