The following pages link to David E. Muller (Q673777):
Displaying 31 items.
- Simulating alternating tree automata by nondeterministic automata: New results and new proofs of the theorems of Rabin, McNaughton and Safra (Q673778) (← links)
- Groups, the theory of ends, and context-free languages (Q792454) (← links)
- The theory of ends, pushdown automata, and second-order logic (Q1084096) (← links)
- Alternating automata on infinite trees (Q1098325) (← links)
- (Q1185241) (redirect page) (← links)
- Parallel restructuring and evaluation of expressions (Q1185242) (← links)
- Alternating automata, the weak monadic theory of trees and its complexity (Q1193871) (← links)
- The time required to evaluate division-free arithmetic expressions (Q1231389) (← links)
- Finding the intersection of two convex polyhedra (Q1253450) (← links)
- Finding the intersection of n half-spaces in time O(n log n) (Q1260355) (← links)
- Frequency of decomposability among machines with a large number of states (Q2536055) (← links)
- Generation of near-optimal universal Boolean functions (Q2537976) (← links)
- A Method for Solving Algebraic Equations Using an Automatic Computer (Q3236082) (← links)
- (Q3319342) (← links)
- ON THE COMPLEXITY OF RECOGNIZABLE ω-TREE SETS AND NERODE THEOREM (Q3348430) (← links)
- (Q3359781) (← links)
- (Q3679818) (← links)
- (Q3748266) (← links)
- (Q3891762) (← links)
- Context-free languages, groups, the theory of ends, second-order logic, tiling problems, cellular automata, and vector addition systems (Q3942944) (← links)
- Efficient Parallel Evaluation of Boolean Expressions (Q4093348) (← links)
- Bounds to Complexities of Networks for Sorting and for Switching (Q4101728) (← links)
- Restructuring of Arithmetic Expressions For Parallel Evaluation (Q4102726) (← links)
- Reduction of Depth of Boolean Networks with a Fan-In Constraint (Q4135413) (← links)
- (Q4726235) (← links)
- (Q4946211) (← links)
- FINITE STATE PROCESSES, Z-TEMPORAL LOGIC AND THE MONADIC THEORY OF THE INTEGERS (Q5286026) (← links)
- (Q5558258) (← links)
- Connectivity and Reversibility in Automata (Q5613956) (← links)
- On the Delay Required to Realize Boolean Functions (Q5622111) (← links)
- Boolean Algebras in Electric Circuit Design (Q5827336) (← links)
