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.
Frequently asked questions
Simply head over to the account section in settings and click on āCancel Subscriptionā - itās as simple as that. After you cancel, your membership will stay active for the remainder of the time youāve paid for. Learn more here.
At the moment all of our mobile-responsive ePub books are available to download via the app. Most of our PDFs are also available to download and we're working on making the final remaining ones downloadable now. Learn more here.
Both plans give you full access to the library and all of Perlegoās features. The only differences are the price and subscription period: With the annual plan youāll save around 30% compared to 12 months on the monthly plan.
We are an online textbook subscription service, where you can get access to an entire online library for less than the price of a single book per month. With over 1 million books across 1000+ topics, weāve got you covered! Learn more here.
Look out for the read-aloud symbol on your next book to see if you can listen to it. The read-aloud tool reads text aloud for you, highlighting the text as it is being read. You can pause it, speed it up and slow it down. Learn more here.
Yes, you can access Regular Algebra and Finite Machines by John Horton Conway in PDF and/or ePUB format, as well as other popular books in Mathematics & Algebra. We have over one million books available in our catalogue for you to explore.
The maintenance man in charge of a real machine M often has occasion to experiment with M. Sometimes he will be presented with M in some unaccustomed (and probably unknown) state and required to return it with a note specifying its new state. Occasionally he might suspect that some malfunction has transformed M into a new (and probably useless) machine Mā², and will need to devise an experiment to determine whether this has in fact occurred. In both cases his method will probably be to apply certain inputs to the machine (each input depending on the previous outputs) until the resulting sequence of outputs in some sense contains the information he requires. The outcome of the experiment will be a member of some set of answers, for instance the set {yes, no, donāt know}.
Formally, we define an experiment on M as a function e: O* ā I
A, where O* is the set of all output words (i.e., finite formal sequences of outputs), and A is some set of answers, disjoint from I. We perform e on M as follows. At any stage we will already have applied a word w = ab ā¦ k, and observed the resulting output word
If e(r(
, w)) is an input l, say, we extend w by applying l to the machine and observing the new output o(
ab ā¦ kl), so proceeding to the next state. If not, e(r(
, w)) is an answer called the outcome of e at
, and the experiment terminates.
We can perform the experiment at any state of any machine with the same console as M, and its outcome, if any, will probably depend on both machine and state. If in all intended performances it terminates in a bounded number of stages, we call if finite, and define its length as the greatest length of any of the corresponding input words w. (Note that the length of an input word w is one less than that of the resulting output word r(
, w), since the first output ācomes freeā.) We shall mostly be conce...
Table of contents
Cover Page
Title Page
Copyright Page
Contents
Preface
Preliminaries to the Moore Theory
1. Mooreās theory of experiments
2. Bombs and detonators
3. Kleeneās theory of regular events and expressions
