The following pages link to Ronald E. Prather (Q1236625):
Displaying 21 items.
- Epimorphisms of free monoids (Q1236626) (← links)
- The subprogram problem for software metric design (Q1350112) (← links)
- Computational Aids for Determining the Minimal Form of a Truth Function (Q3271846) (← links)
- (Q3320395) (← links)
- Theory of Program Testing-An Overview (Q3700814) (← links)
- (Q3734317) (← links)
- Generating the k-Subsets of an n-Set (Q3897063) (← links)
- A convenient cryptomorphic version of recursive function theory (Q4063422) (← links)
- Polynomial Calculus with D-Like Operators (Q4081737) (← links)
- Structured turing machines (Q4141223) (← links)
- Realization of Boolean Expressions by Atomic Digraphs (Q4158984) (← links)
- Regular Expressions for Program Computations (Q4340675) (← links)
- The type structure of CAT (Q4594266) (← links)
- The Path Prefix Software Testing Strategy (Q4727418) (← links)
- (Q4747489) (← links)
- On Tree Circuits (Q5511655) (← links)
- New Associate Editors and Reviews Editor (Q5518859) (← links)
- Minimal solutions of Paull-Unger problems (Q5563373) (← links)
- On categories of infinite automata (Q5608775) (← links)
- An Algebraic Proof of the Paull–Unger Theorem (Q5628033) (← links)
- Epimorphisms in certain categories of transducers (Q5661437) (← links)
