## Introductory Theory of Computer Science |

### What people are saying - Write a review

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

### Contents

RECURSION AND ITERATION | 12 |

MACHINES | 18 |

BEHAVIOURAL DESCRIPTION | 26 |

Copyright | |

10 other sections not shown

### Common terms and phrases

alphabet set applied arguments axiom base functions basic binary Boolean bounded minimalization called computable functions computer science concatenation conditional expression construct context-free grammar correctness corresponding decision problem defined definition denoted derivation directed graph DPDM edges elements equivalent finite number finite set flowchart follows formal FSM's functional matrix given grammar G graph G halting problem initial input symbol integers iteration labelled left-most Let G linear grammar logical loop Markov algorithm mathematical n-ary natural numbers NDTM node non-deterministic non-terminal number-theoretic obtained operation output pair palindrome parentheses parse tree PMT system prime primitive recursive functions production rules programming language prove push-down regular expressions regular sets relation replace representation sentence sentential form sequence shown in Fig solvable stack statement Step string structure subset Table tape terminal theorems theory tion transition graph true Turing machine unary undefined unsolvable variable vertex words