## Introduction to Switching and Automata Theory |

### What people are saying - Write a review

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

### Contents

Chapter 1Mathematical Background | 1 |

Proofs | 5 |

Relations | 9 |

Copyright | |

88 other sections not shown

### Common terms and phrases

abstract algebra algorithm Assume Axiom behavior boolean algebra boolean form boolean function branch-type called CN CN complement compute congruence relation connected connected machines constructed context-free language Corollary cube cycle index defined denoted equivalence classes equivalence relation EXAMPLE FH FH FH finite machine given grammar graph homomorphism input integer invariants isomorphic Lemma lg(x mapping Math matrix method minimal monotone functions N H Switching Circuit nodes number of classes number of equivalence one-equivalent output permutation permutation group prime subcubes Prob PROBLEMS PROOF Proposition realization regular expression regular sets relay representation result right congruence sequence sequential machine Show shown in Fig Si(w Si(x St(w subset Suppose Switching Circuit R C S G T switching functions symbol symmetric functions symmetric group synthesis terminals Theorem Theory transition system tree two-terminal variables weakly p definite