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=14
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Foreword, to Special Issue on Formal Language Theory
R.V. Book
Theoretical Computer Science
14
, 1981, pp. 125
Some elements of a Galois theory of the structure and complexity of the tree automorphism problem
G. Gati
Theoretical Computer Science
14
, 1981, pp. 1-17
Merging of 4 or 5 elements with
n
elements
J. Schulte Mönting
Theoretical Computer Science
14
, 1981, pp. 19-37
The firing squad synchronization problem for graphs
Y. Nishitani
,
N. Honda
Theoretical Computer Science
14
, 1981, pp. 39-61
On generalized language equations
E. Leiss
Theoretical Computer Science
14
, 1981, pp. 63-77
Optimal algorithms for sensitivity analysis in associative multiplication problems
A. Rosenthal
Theoretical Computer Science
14
, 1981, pp. 79-90
On
\Gamma
-reducibility versus polynomial time many-one reducibility
T.J. Long
Theoretical Computer Science
14
, 1981, pp. 91-101
On the theoretical efficiency of various network flow algorithms
Zvi Galil
Theoretical Computer Science
14
, 1981, pp. 103-111
An elementary proof of the completeness of PDL (Note)
D. Kozen
,
R. Parikh
Theoretical Computer Science
14
, 1981, pp. 113-118
A propos de lemme de substitution (Note)
M. Latteux
Theoretical Computer Science
14
, 1981, pp. 119-123
The power of synchronizing operations on strings
Matthias Jantzen
Theoretical Computer Science
14
, 1981, pp. 127-154
DPDA's in ``Atomic Normal Form'' and applications to equivalence problems
Jean H. Gallier
Theoretical Computer Science
14
, 1981, pp. 155-186
Substitution of semi-AFL's
J. Beauquier
Theoretical Computer Science
14
, 1981, pp. 187-193
Classification of finite monoids: The language approach
D. Thérien
Theoretical Computer Science
14
, 1981, pp. 195-208
Pattern decomposition for tessellation automata
A. Maruoka
,
M. Kimura
,
N. Shoji
Theoretical Computer Science
14
, 1981, pp. 211-226
Concise description of finite languages
W. Bucher
,
H.A. Maurer
,
K. Culik II
,
D. Wotschke
Theoretical Computer Science
14
, 1981, pp. 227-246
Computations of
(\alpha, k)
-machines
J. Stoklosa
,
W. Zakowski
Theoretical Computer Science
14
, 1981, pp. 247-265
On pure, terminal invariant and nonterminal invariant interpretations of EOL forms
G. Rozenberg
,
R. Verraedt
Theoretical Computer Science
14
, 1981, pp. 267-288
General approximation algorithms for some arithmetical combinatorial problems
Shlomo Moran
Theoretical Computer Science
14
, 1981, pp. 289-303
About the implementability and the power of equationally defined data abstractions
G. Callegarin
,
G. Pacini
Theoretical Computer Science
14
, 1981, pp. 305-315
Coloured Petri nets and the invariant-method
K. Jensen
Theoretical Computer Science
14
, 1981, pp. 317-336
A note on a problem in the theory of grammatical complexity (Note)
W. Bucher
Theoretical Computer Science
14
, 1981, pp. 337-344