| 1998 |
|---|
| 16 | EE | Paul E. Schupp:
On the Structure of Hamiltonian Cycles in Cayley Graphs of Finite Quotients of the Modular Group.
Theor. Comput. Sci. 204(1-2): 233-248 (1998) |
| 1995 |
|---|
| 15 | EE | David E. Muller,
Paul E. Schupp:
Simulating Alternating Tree Automata by Nondeterministic Automata: New Results and New Proofs of the Theorems of Rabin, McNaughton and Safra.
Theor. Comput. Sci. 141(1&2): 69-107 (1995) |
| 1992 |
|---|
| 14 | | David E. Muller,
Paul E. Schupp,
Ahmed Saoudi:
On the Decidability of the Linear Z-Temporal Logic and the Monadic Second Order Theory.
ICCI 1992: 2-5 |
| 13 | | Ahmed Saoudi,
David E. Muller,
Paul E. Schupp:
Finite State Processes, Z-Temporal Logic and the Monadic Theory of the Integers.
Int. J. Found. Comput. Sci. 3(3): 233-244 (1992) |
| 12 | | David E. Muller,
Ahmed Saoudi,
Paul E. Schupp:
Alternating Automata, the Weak Monadic Theory of Trees and its Complexity.
Theor. Comput. Sci. 97(2): 233-244 (1992) |
| 1990 |
|---|
| 11 | | Ahmed Saoudi,
David E. Muller,
Paul E. Schupp:
On the Complexity of omega-Tree Sets and Nerode Theorem.
Int. J. Found. Comput. Sci. 1(1): 11-22 (1990) |
| 1988 |
|---|
| 10 | | David E. Muller,
Ahmed Saoudi,
Paul E. Schupp:
Weak Alternating Automata Give a Simple Explanation of Why Most Temporal and Dynamic Logics are Decidable in Exponential Time
LICS 1988: 422-427 |
| 1987 |
|---|
| 9 | | David E. Muller,
Paul E. Schupp:
Alternating Automata on Infinite Trees.
Theor. Comput. Sci. 54: 267-276 (1987) |
| 1986 |
|---|
| 8 | | Paul E. Schupp:
Arrays, Automata and Groups: Some Interconnections.
Automata Networks 1986: 19-28 |
| 7 | | David E. Muller,
Ahmed Saoudi,
Paul E. Schupp:
Alternating Automata. The Weak Monadic Theory of the Tree, and its Complexity.
ICALP 1986: 275-283 |
| 6 | | Dominique Perrin,
Paul E. Schupp:
Automata on the Integers, Recurrence Distinguishability, and the Equivalence and Decidability of Monadic Theories
LICS 1986: 301-304 |
| 1985 |
|---|
| 5 | | David E. Muller,
Paul E. Schupp:
The Theory of Ends, Pushdown Automata, and Second-Order Logic.
Theor. Comput. Sci. 37: 51-75 (1985) |
| 1984 |
|---|
| 4 | | David E. Muller,
Paul E. Schupp:
Alternating automata on infinite objects, determinacy and Rabin's theorem.
Automata on Infinite Words 1984: 100-107 |
| 3 | | Dominique Perrin,
Paul E. Schupp:
Sur les Monoides À un Relateur qui sont des Groupes.
Theor. Comput. Sci. 33: 331-334 (1984) |
| 1983 |
|---|
| 2 | | David E. Muller,
Paul E. Schupp:
Groups, the Theory of Ends, and Context-Free Languages.
J. Comput. Syst. Sci. 26(3): 295-310 (1983) |
| 1981 |
|---|
| 1 | | David E. Muller,
Paul E. Schupp:
Pushdown Automata, Graphs, Ends, Second-Order Logic, and Reachability Problems
STOC 1981: 46-54 |
