A particular class of finite-state automata, christened by the authors &"counter-free,&" is shown here to behave like a good actor: it can drape itself so thoroughly in the notational guise and embed itself so deeply in the conceptual character of several quite different approaches to automata theory that on the surface it is hard to believe that all these roles are being assumed by the same class. This is one of the reasons it has been chosen for study here. The authors write that they &"became impressed with the richness of its mathematical complexity&" and that &"a sure sign of gold is when profound mathematical theory interacts with problems that arise independently. And indeed it is noteworthy that the class of automata we shall discuss was defined more or less explicitly by several people working from very different directions and using very different concepts. The remarkable happening was that these definitions could not be recognized as equivalent until algebraic tools of analysis were brought to the field in the works of Schutzenberger and in the works of Krohn and Rhodes.&" The theme of the monograph is the utility and equivalence of these different definitions of counter-free automata. Its organization follows the plan of taking up, one by one, each of a number of different conceptualizations: the historically important &"nerve net&" approach; the algebraic approach, in which automata are treated as semigroups; the &"classical&" theory based on state transition diagrams; the &"linguistic&" approach based on the concept of regular expressions; and the &"behavioral&" descriptions using symbolic logic. In each of these conceptual areas, the class of automata under study is found in a new guise. Each time it appears as yet another special case. The authors' burden is to show that all these definitions are in fact equivalent. Care has been taken so that this research monograph can be used as a self-sufficient text. Notations have been defined carefully and always in the context of the discussion. Most of the chapters end with a substantial number of exercises. It is self-contained in that all concepts are defined, and all theorems used are, with one exception, either fully proved or safely left as exercises for the student.
What people are saying - Write a review
We haven't found any reviews in the usual places.
Local Testing and Order
The Syntactic Monoid of a Regular Event
10 other sections not shown
algebraic algorithm alphabet atomic formulas atomic terms automata theory automaton behavioral description behavioral formula Boolean operations buzzer-free C-predicates Chapter characterization class of events concatenation congruence class construction decomposition defined definiens definite event delay described elements equivalent event 77 events represented example excitory Exercise feedback axons finite automata finite monoid finite-state first-order first-order logic flip-flop FOLc follows graph G idempotent Ik(W incidence point incident axons initial input violation input word integer Lemma Lk(W locally testable events loop complexity loop-free machine maximal subgroups modulo monograph nerve nets neuron noncounting events nontrivial permutation Note null word occur parsable positive integer predicate variables proof of Theorem Prove pulse quantifier reader realizable reduced state graph regular events regular expression Rk(W segment semigroup set of words star star-free expression strict sense subset Suppose symbolic logic syntactic monoid Theorem trivial subgroups words of length zero