Travelled to:
1 × France
1 × USA
1 × United Kingdom
Collaborated with:
P.E.Schupp A.Saoudi
Talks about:
automata (3) altern (2) logic (2) weak (2) exponenti (1) reachabl (1) pushdown (1) problem (1) complex (1) theori (1)
Person: David E. Muller
DBLP: Muller:David_E=
Contributed to:
Wrote 3 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.
- 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.