David E. Muller
University of Illinois at Urbana–Champaign
27 Papers
119 Citations
David E. Muller is an academic researcher from University of Illinois at Urbana–Champaign. The author has contributed to research in topics: Automata theory & Decidability. The author has an hindex of 15, co-authored 27 publications.
Chat about Author
Papers
The theory of ends, pushdown automata, and second-order logic
David E. Muller,Paul E. Schupp +1 more
TL;DR: These graphs are generalizations of Cayley graphs of context-free groups and shown to be definable in a very natural way in terms of push-down automata and to have a decidable monadic second-order theory.
411
Finding the intersection of two convex polyhedra
TL;DR: An algorithm to test whether their intersection is empty, and if so to find a separating plane, and to construct their intersection polyhedron is developed, which runs in timeO (n log n), where n is the sum of the numbers of vertices of the two polyhedra.
351
Alternating automata, the weak monadic theory of the tree, and its complexity
David E. Muller,Ahmed Saoudi,Paul E. Schnupp +2 more
- 15 Jul 1986
TL;DR: We show that alternating automata do not give a simple proof of Rabin’s fundamental theorem on the decidability of the full monadic theory of the tree.
168
Alternating automata, the weak monadic theory of trees and its complexity
TL;DR: It is shown that alternating automata do not give a simple proof of Rabin’s fundamental theorem on the decidability of the full monadic theory of the tree, and one must appeal to the powerful “forgetful determinacy” theorem of Gurevitch and Harrington to show that alternation can be simulated by nondeterministic Rabin automata.
65