## A basis for theoretical computer science |

### What people are saying - Write a review

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

### Other editions - View all

A Basis for Theoretical Computer Science Michael A. Arbib,A. J. Kfoury,Robert N. Moll Snippet view - 1981 |

A Basis for Theoretical Computer Science M.A. Arbib,A. J. Kfoury,R. N. Moll No preview available - 1981 |

### Common terms and phrases

algebraic algorithm alphabet array Basis Step bijection binary search binary tree binomial Boolean function called computer science Consider context-free grammar corresponding decimal define denote diagram digit disjoint disjunctive normal form edges element entry equal equivalence class equivalence relation Euler path exactly example Exercises for Section Fibonacci Figure finite set finite-state language formal formula given identity induction step inductive definition infinite inorder input integers label lemma length Lisp matrix monoid multiplication natural numbers notation number of nodes objects odd number ordered trees pair palindromes partial function partial order permutations phone number Pigeonhole Principle player player postorder preorder proof by induction propositional logic prove recurrence relation recursive definition root Rule of Product Rule of Sum s-expressions semiring sequence sequential search square subset symbol theorem tree of height true truth table truth value undirected graph upper bound write