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=126
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Model checking and boolean graphs
Henrik Reif Andersen
Theoretical Computer Science
126
(1), 1994, pp. 3-30
Decidability of reachability for disjoint union of term rewriting systems
Anne-Cécile Caron
,
Jean-Luc Coquidé
Theoretical Computer Science
126
(1), 1994, pp. 31-52
Monadic second-order definable graph transductions: A survey
Bruno Courcelle
Theoretical Computer Science
126
(1), 1994, pp. 53-75
CTL* and ECTL* as fragments of the modal
\mu
-calculus
Mads Dam
Theoretical Computer Science
126
(1), 1994, pp. 77-96
Modulo-counting quantifiers over finite trees
Andreas Potthoff
Theoretical Computer Science
126
(1), 1994, pp. 97-112
Finite tree automata with cost functions
Helmut Seidl
Theoretical Computer Science
126
(1), 1994, pp. 113-142
Proving partial order properties
Doron Peled
,
Amir Pnueli
Theoretical Computer Science
126
(2), 1994, pp. 143-182
A theory of timed automata
Rajeev Alur
,
David L. Dill
Theoretical Computer Science
126
(2), 1994, pp. 183-235
Unification in free distributive lattices
J.A. Gerhard
,
Mario Petrich
Theoretical Computer Science
126
(2), 1994, pp. 237-257
Confluence by decreasing diagrams
Vincent van Oostrom
Theoretical Computer Science
126
(2), 1994, pp. 259-280
Une équivalence sur les lambda-termes
Laurent Regnier
Theoretical Computer Science
126
(2), 1994, pp. 281-292