Travelled to:1 × France
1 × United Kingdom
2 × USA
Collaborated with:D.E.Muller A.Saoudi D.Perrin
Talks about:automata (4) theori (2) altern (2) monad (2) logic (2) decid (2) weak (2) distinguish (1) exponenti (1) reachabl (1)
Person: Paul E. Schupp
DBLP: Schupp:Paul_E=
Contributed to:
1988
19861986
1981Wrote 4 papers:
- LICS-1988-MullerSS #automaton #decidability #exponential #logic #why
- Weak Alternating Automata Give a Simple Explanation of Why Most Temporal and Dynamic Logics are Decidable in Exponential Time (DEM, AS, PES), pp. 422–427.
- ICALP-1986-MullerSS #automaton #complexity #monad
- Alternating Automata. The Weak Monadic Theory of the Tree, and its Complexity (DEM, AS, PES), pp. 275–283.
- LICS-1986-PerrinS #automaton #decidability #equivalence #integer #monad
- Automata on the Integers, Recurrence Distinguishability, and the Equivalence and Decidability of Monadic Theories (DP, PES), pp. 301–304.
- STOC-1981-MullerS #automaton #graph #higher-order #logic #problem #reachability
- Pushdown Automata, Graphs, Ends, Second-Order Logic, and Reachability Problems (DEM, PES), pp. 46–54.