## Conference Record, 1971 Twelfth Annual Symposium on Switching and Automata Theory: Papers Presented at the Twelfth Annual Symposium, East Lansing, Mich., October 13-15, 1971 |

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Contents

High Level Languages of Maximum Power by H R Strong | 1 |

On the Composition of Parallel Program Schemata | 20 |

Effective Computation Over the Real Numbers | 33 |

Copyright | |

15 other sections not shown

### Common terms and phrases

A-cell accept cell algebraic algorithm applied arbitrary array assume asynchronous circuits augmenting path automata Automata Theory biconnected binary Boolean boundary layer called cellular complexity measure computation construct contains context-free grammars Corollary corresponding defined Definition denote depth-first search deterministic directed graph edges elements equivalent evaluation example exists fault-detection sequence Figure finite automaton flow table follows function f given grammar G graph halting problem Hence implies input integers k+1)-testable labels Lemma Let G logical constant LR(k matrix minterms multiplication n-wfa next-state non-scalar obtained operations output function parsing partial ordering relation polynomial predicate problem procedure program schemata real numbers realized recursive functions regular partition regular sets result S-invariant scan sequential machine shown in Fig smear monoid step string strongly connected component subset Suppose switching function symbols synthesis T-factor Theorem theory tion transitive closure Turing machines variables vertex vertices