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
[1]
Hilfe
Suche: Author="Schupp, P.E."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Finite state processes,
Z
-temporal logic and the monadic theory of the integers
A. Saoudi
,
D.E. Muller
,
P.E. Schupp
International Journal of Foundations of Computer Science
3
(3), 1992, pp. 233-244
On the complexity of recognizable
\omega
-tree sets and Nerode theorem
A. Saoudi
,
D.E. Muller
,
P.E. Schupp
International Journal of Foundations of Computer Science
1
(1), 1990, pp. 11-21
Recognizable infinite tree sets and their complexity
A. Saoudi
,
D.E. Muller
,
P.E. Schupp
Lecture Notes in Computer Science
472
, 1990, pp. 91-103
Alternating automata on infinite trees
D.E. Muller
,
P.E. Schupp
Theoretical Computer Science
54
(2-3), 1987, October, pp. 267-276
The theory of ends, pushdown automata, and second-order logic
D.E. Muller
,
P.E. Schupp
Theoretical Computer Science
37
(1), 1985, pp. 51-75
Groups, the theory of ends, and context-free languages
D.E. Muller
,
P.E. Schupp
Journal of Computer and System Sciences
26
(3), 1983, June, pp. 295-310
Pushdown automata, graphs, ends, second-order logic, and reachability problems
D.E. Muller
,
P.E. Schupp
Proceedings of the 13th Annual ACM Symposium on Theory of Computing, STOC'81 (Milwaukee, WI, May 11-13, 1981)
, 1981, pp. 46-54