Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Journal=Theor.~Comput.~Sci. AND Volume=83
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Polymorphic rewriting conserves algebraic strong normalization
Val Breazu-Tannen
,
Jean Gallier
Theoretical Computer Science
83
, 1991, pp. 3-28
Recursive types for Fun
Felice Cardone
Theoretical Computer Science
83
, 1991, pp. 29-56
About primitive recursive algorithms
Loïc Colson
Theoretical Computer Science
83
, 1991, pp. 57-69
Completing the temporal picture
Zohar Manna
,
Amir Pnueli
Theoretical Computer Science
83
, 1991, pp. 97-130
Foundations of rule-based design of modular systems
Francesco Parisi-Presicce
Theoretical Computer Science
83
, 1991, pp. 131-155
A note on model checking the modal
\nu
-calculus
Glynn Winskel
Theoretical Computer Science
83
, 1991, pp. 157-167
New formally undecidable propositions: non-trivial lower bounds on proof complexity and related theorems
H. Luckhardt
Theoretical Computer Science
83
, 1991, pp. 169-188
Derived linear systems of context-free grammars
David Mauro
Theoretical Computer Science
83
, 1991, pp. 189-203
A periodic division pattern that cannot be generated by DOL systems
Martin J.M. de Boer
,
Aristid Lindenmayer
,
Zsolt Tuza
Theoretical Computer Science
83
, 1991, pp. 205-218
Complexité du calcul du développement d'un nombre réel en fractions continues
S. Labhalla
Theoretical Computer Science
83
, 1991, pp. 219-235
On standard locally catenative L schemes
Shigeko Seki
,
Youichi Kobuchi
Theoretical Computer Science
83
, 1991, pp. 237-248
Nonacceptability criteria and closure properties for the class of languages accepted by binary systolic tree automata
E. Fachini
,
A. Maggiolo Schettini
,
G. Resta
,
D. Sangiorgi
Theoretical Computer Science
83
, 1991, pp. 249-260
On the Hurwitz product of formal power series and automata
Gerhard Küster
Theoretical Computer Science
83
, 1991, pp. 261-273
Parallel comparison merging of many-ordered lists
Y. Azar
Theoretical Computer Science
83
, 1991, pp. 275-285
Minimal strings in a regular language with respect to a partial order on the alphabet
Sukhamay Kundu
Theoretical Computer Science
83
, 1991, pp. 287-300
On the expressive power of temporal logic for infinite words
Joëlle Cohen-Chesnot
Theoretical Computer Science
83
, 1991, pp. 301-312
Kolmogorov characterizations of complexity classes
Lane A. Hemachandra
,
Gerd Wechsung
Theoretical Computer Science
83
, 1991, pp. 313-322
Hierarchies of weak automata and weak monadic formulas
A.W. Mostowski
Theoretical Computer Science
83
, 1991, pp. 323-335
On the p-isomorphism conjecture
Osamu Watanabe
Theoretical Computer Science
83
, 1991, pp. 337-343