Regular Algebra and Finite MachinesCourier Corporation, 1 jan 2012 - 147 pagina's 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. |
Overige edities - Alles bekijken
Veelvoorkomende woorden en zinsdelen
a₁ algorithm alphabet axioms b₁ biregular biregulators bomb Boolean Chapter compute context-free languages Corollary corresponding deduced from C13 define differentiation distinguishable E₁ equations equivalent experiment of length F₁ finite machine finite sum follows free S-algebra halting problem homomorphism implies infinite intersection isomorphic Kleene algebra L₁ lemma linear mechanism matrix maximal minimal solution Moore machine n,m,p)-machine nodes normal form normal system Ø Ø obtained Post correspondence problem problem Proof prove R-tautology R₁ radical algebra reduced regular events regular expressions regular functions regular operations regular tautologies regulator algebra result right factors S-algebra satisfy semigroup sequence starred words subfactorization sum of terms suppose symbol t₁ tape Theorem Theorem 9 theory total regulators transition Turing machine u₁ variables w₁ word derivates word of length X₁ Y₁ дх وه