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=46
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Morphismes unispectraux
Christian Mauduit
Theoretical Computer Science
46
, 1986, pp. 1-11
Abstract data types with exception handling: an initial approach based on a distinction between exceptions and errors
G. Bernot
,
M. Bidoit
,
C. Choppy
Theoretical Computer Science
46
(1), 1986, pp. 13-45
Disjunctive decomposition of languages
Y.Q. Guo
,
G.W. Xu
,
G. Thierrin
Theoretical Computer Science
46
(1), 1986, pp. 47-51
Notes on finitely generated semigroups and pumping conditions for regular languages
K. Hashiguchi
Theoretical Computer Science
46
(1), 1986, pp. 53-66
Nonapplicable nulls
N. Lerat
,
W., Jr. Lipski
Theoretical Computer Science
46
(1), 1986, pp. 67-82
Periodic D0L languages
T. Head
,
B. Lando
Theoretical Computer Science
46
(1), 1986, pp. 83-89
Characterization of
\omega
-regular languages by monadic second-order formulas
H. Yamasaki
,
M. Takahashi
,
K. Kobayashi
Theoretical Computer Science
46
(1), 1986, pp. 91-99
Two characterizations of rational adherences
M. Latteux
,
E. Timmerman
Theoretical Computer Science
46
(1), 1986, pp. 101-106
Some complexity bounds for problems concerning finite and 2-dimensional vector addition systems with states
Rodney R. Howell
,
Louis E. Rosier
,
Dung T. Huynh
,
Hsu-Chun Yen
Theoretical Computer Science
46
(2/3), 1986, pp. 107-140
Semantics of infinite tree logic programming
J. Jaffar
,
P.J. Stuckey
Theoretical Computer Science
46
(2-3), 1986, pp. 141-158
On some equations in free partially commutative monoids
C. Duboc
Theoretical Computer Science
46
(2-3), 1986, pp. 159-174
Generalized regular expressions-a language for synthesis of programs with branching in loops
A. Brazma
,
E. Kinber
Theoretical Computer Science
46
(2-3), 1986, pp. 175-195
Computability in higher types,
P_{\omega}
and the completeness of type assignment
G. Longo
,
S. Martini
Theoretical Computer Science
46
(2-3), 1986, pp. 197-217
Average polynomial time complexity of some
NP
-complete problems
Phan Dinh Dieu
,
Le Cong Thanh
,
Le Tuan Hoa
Theoretical Computer Science
46
(2-3), 1986, pp. 219-237
A simple dynamic logic
P. Hajek
Theoretical Computer Science
46
(2-3), 1986, pp. 239-259
The automated proof of a trace transformation for a bitonic sort
Chua-Huang Huang
,
C. Lengauer
Theoretical Computer Science
46
(2-3), 1986, pp. 261-284
An algebraic and algorithmic method for analysing transition systems
A. Dicky
Theoretical Computer Science
46
(2-3), 1986, pp. 285-303
Proof of termination of the rewriting system SUBST on CCL
T. Hardin
,
A. Laville
Theoretical Computer Science
46
(2-3), 1986, pp. 305-312
On some variants of the Ehrenfeucht Conjecture
V. Diekert
Theoretical Computer Science
46
(2-3), 1986, pp. 313-318
Commutative monoids have complete presentations by free (non-commutative) monoids
V. Diekert
Theoretical Computer Science
46
(2-3), 1986, pp. 319-327
Lower bounds for the approximative complexity
B. Griesser
Theoretical Computer Science
46
(2-3), 1986, pp. 329-338