Regular Algebra and Finite MachinesCourier Corporation, 16 sept. 2012 - 160 pages World-famous mathematician John H. Conway based this classic text on a 1966 course he taught at Cambridge University. Geared toward graduate students of mathematics, it will also prove a valuable guide to researchers and professional mathematicians. His topics cover Moore's theory of experiments, Kleene's theory of regular events and expressions, Kleene algebras, the differential calculus of events, factors and the factor matrix, and the theory of operators. Additional subjects include event classes and operator classes, some regulator algebras, context-free languages, communicative regular algebra, axiomatic questions, the strength of classical axioms, and logical problems. Complete solutions to problems appear at the end. |
Autres éditions - Tout afficher
Expressions et termes fréquents
algorithm alphabet axioms bb*a biregular biregulators bomb Boolean bracket Chapter classical axioms compute conjecture contains context-free languages Corollary corresponding deduce define definition denotes differentiation distinguishable elements equations equivalent events F experiment of length factor theory find finite set finite sum first follows formula free S-algebra function f halting problem homomorphism implies infinite input letters insoluble isomorphic Kleene algebra Kleene’s lemma linear mechanism maximal minimal solution Moore machine Moore’s n,m,p)-machine nodes normal form normal system nth roots obtained output function pairs Post correspondence problem problem Proof prove R-tautology radical algebra Redko reduced regular events regular expressions regular functions regular operations regular tautologies regulator algebra replace result right factors S-operators satisfies semigroup sequence starred words subfactorization sum of terms suppose symbol tape Theorem 9 theory total regulators transient letter Turing machine variables word derivates word of length write