Regular Algebra and Finite Machines
Courier Corporation, 1 janv. 2012 - 147 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.
Avis des internautes - Rédiger un commentaire
Aucun commentaire n'a été trouvé aux emplacements habituels.
Autres éditions - Tout afficher
algebra algorithm alphabet already appear apply approximating argument axioms belongs biregular biregulators Chapter closed complete compute consider constant construction contains Corollary corresponding deduce deﬁne determine differentiation distinct distinguishable easy elements entries equality equations equivalent example experiment fact factors ﬁnd ﬁnite ﬁnite sum ﬁrst follows formula give given hold implies inﬁnite initial input instance intersection involves language least length letters linear machine matrix maximal mean mechanism minimal normal system Note observe obtained obvious operators output pairs particular possible problem Proof properties prove reduced regular events regular expressions regular functions regulator regulator algebra relations replace represented result S-algebra satisfy sequence similar solution star sum of terms suppose symbol tape tautology terminal Theorem theory transition unique values variables word derivates write