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=18
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Abstract data types and algebraic semantics of programming languages
C. Pair
Theoretical Computer Science
18
, 1982, pp. 1-31
Mixed computation: Potential applications and problems for study
A.P. Ershov
Theoretical Computer Science
18
, 1982, pp. 41-67
On form-equivalence of deterministic pure grammar forms
J. Hagauer
Theoretical Computer Science
18
, 1982, pp. 69-87
A family of graphs with expensive depth-reduction (Note)
G. Schnitger
Theoretical Computer Science
18
, 1982, pp. 89-93
A uniform approach to obtain diagonal sets in complexity classes
Uwe Schöning
Theoretical Computer Science
18
, 1982, pp. 95-103
The complexity of Presburger arithmetic with bounded quantifier alternation depth
Martin Fürer
Theoretical Computer Science
18
, 1982, pp. 105-111
Recognizable formal power series on trees
J. Berstel
,
C. Reutenauer
Theoretical Computer Science
18
, 1982, pp. 115-148
Adequacy properties of path programs
E. Best
Theoretical Computer Science
18
, 1982, pp. 149-171
Proposition de sémantique dénotationnelle pour des réseaux de processus avec opérateur de mélange équitable
F. Boussinot
Theoretical Computer Science
18
, 1982, pp. 173-206
Properties of structure generating functions of automata and their applications for linear systems
K. Uchimura
Theoretical Computer Science
18
, 1982, pp. 207-220
Sharp characterizations of squarefree morphisms (Note)
M. Chrochemore
Theoretical Computer Science
18
, 1982, pp. 221-226
A unified approach for studying the properties of transition systems
Joseph Sifakis
Theoretical Computer Science
18
, 1982, pp. 227-258
Unprovability of theorems of complexity theory in weak number theories
Daniel Leivant
Theoretical Computer Science
18
, 1982, pp. 259-268
Strong surjectivity is equivalent to
C
-injectivity
A. Maruoka
,
M. Kimura
Theoretical Computer Science
18
, 1982, pp. 269-277
Dominoes over a free monoid
K. Culik II
,
T. Harju
Theoretical Computer Science
18
, 1982, pp. 279-300
Expressing program looping in regular dynamic logic
A.R. Meyer
,
K. Winklmann
Theoretical Computer Science
18
, 1982, pp. 301-323
When is a monoid a group? The Curch-Rosser case is tractable (Note)
R.V. Book
Theoretical Computer Science
18
, 1982, pp. 325-331
Generalization of the Ginsburg-Rice Schützenberger fixed-point theorem for context-sensitive and recursive-enumerable languages (Note)
S. Istrail
Theoretical Computer Science
18
, 1982, pp. 333-341