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=31
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Generalized parenthesis languages and minimization of their parenthesis parts
H. Yamasaki
,
M. Takahashi
Theoretical Computer Science
31
(1,2), 1984, pp. 1-11
A proof technique for parallel programs
N. Soundararajan
Theoretical Computer Science
31
(1,2), 1984, pp. 13-29
On combinatory algebras and their expansions
K. Bruce
,
G. Longo
Theoretical Computer Science
31
(1,2), 1984, pp. 31-40
Minimal pairs for P
U. Schöning
Theoretical Computer Science
31
(1,2), 1984, pp. 41-48
Characterizing specification languages which admit initial semantics
B. Mahr
,
J.A. Makowsky
Theoretical Computer Science
31
(1,2), 1984, pp. 49-59
Bases and ambiguity of number systems
J. Honkala
Theoretical Computer Science
31
(1,2), 1984, pp. 61-71
A characterization of Plotkin's order in powerdomains, and some of its properties
D. Frutos Escrig
Theoretical Computer Science
31
(1,2), 1984, pp. 73-82
Langages infinitaires et produit de mixage
R. de Simone
Theoretical Computer Science
31
(1,2), 1984, pp. 83-100
Reducibilities on real numbers
K. Ko
Theoretical Computer Science
31
(1,2), 1984, pp. 101-123
New
NP
-hard and
NP
-complete polynomial and integer divisibilty problems
D.A. Plaisted
Theoretical Computer Science
31
(1,2), 1984, pp. 125-138
Adherences of DOL languages
T. Head
Theoretical Computer Science
31
(1,2), 1984, pp. 139-149
Une nouvelle
C\beta
-réduction dans la logique combinatoire
M. Mezghiche
Theoretical Computer Science
31
(1,2), 1984, pp. 151-163
The undecidability of the preperfectness of Thue systems
P. Narendran
,
R. McNaughton
Theoretical Computer Science
31
(1,2), 1984, pp. 165-174
Some fundamental algebraic tools for the semantics of computation. Part 1: Comma categories, colimits, signatures and theories
J.A. Goguen
,
R.M. Burstall
Theoretical Computer Science
31
(1,2), 1984, pp. 175-209
Restrictions on NLC graph grammars
A. Ehrenfeucht
,
M.G. Main
,
G. Rozenberg
Theoretical Computer Science
31
(1,2), 1984, pp. 211-223
Truncations of infinite matrices and algebraic series associated with some CF grammars
K. Uchimura
Theoretical Computer Science
31
(3), 1984, pp. 227-261
Some fundamental algebraic tools for the semantics of computation. Part 2: Signed and abstract theories
J.A. Goguen
,
R.M. Burstall
Theoretical Computer Science
31
(3), 1984, pp. 263-295
Equivalence of infinite behavior of finite automata
H. Alaiwan
Theoretical Computer Science
31
(3), 1984, pp. 297-306
Normal Petri nets
H. Yamasaki
Theoretical Computer Science
31
(3), 1984, pp. 307-315
Some results on subclass containment problems for special classes of dpda's related to nonsingular machines
M. Oyamaguchi
Theoretical Computer Science
31
(3), 1984, pp. 317-335
Remarques sur les langages de parenthses
J.-M. Autebert
,
J. Beauquier
,
L. Boasson
,
G. Sénizergues
Theoretical Computer Science
31
(3), 1984, pp. 337-349