What people are saying - Write a review
We haven't found any reviews in the usual places.
Introduction to Sequential Machines
Fundamental Concepts of Abstract Algebra
8 other sections not shown
acceptor algebra applied associated assume automata theory behavior blocks calculate called Chapter characteristic component machines composite machine computable function congruence relation consider context-free language corresponding cosets defined described develop discussion equation equivalence classes equivalence relation example factor finite field finite number finite-state language ft ft ft ft ft/0 GF(p grammar identity illustrated in Figure indicated initial input sequence input symbol integers integral domain irreducible polynomial linear machine linear transform linearly dependent process Markov process mathematical Mealy machine minimal-state Moore machine multiplication next-state mapping node obtain output mapping output process output sequence output symbol partition pairs preserved partitions probabilities problem properties reading head recursive regular expression represent representation rows Section selected semigroup sequences of length sequential machine set Q string subgroup submachine subset tape expression transition diagram transition table Turing machine vector space zero