What people are saying - Write a review
We haven't found any reviews in the usual places.
Recognizers RabinScott Automata
5 other sections not shown
Other editions - View all
A/TT admissible decomposition admissible partition algebra automata axioms belong block of TT called computation congruence relation considered construction corresponding cosets of H cyclic group defined definition denoted direct product elements of G equations equivalence relation example exists finite index finite number finite set following theorem forms a subsemigroup free regular set free semigroup graph G group G group isomorphic grouplike semiautomaton groupoid G hence homomorphic image idempotent identity implies included integers Lemma maton monoid multiplication noncounting regular set nondeterministic normal subgroup Notice number of elements obtained one-to-one mapping pairs partition TT permutation inputs permutation-reset semiautomaton Proof proved reduced automaton regular expression right congruence right cosets right-hand side rules of inference Section semi semiauto semigroup isomorphic set of words simple group subgroup H subsemiautomaton table of derivatives transition graph two-state reset semiautomata universal algebra vertex weak homomorphism