Algebraic Theory of Machines, Languages, and Semi-groupsThe book is an integrated exposition of the algebraic, and especially semigroup-theoretic, approach to machines and languages. It is designed to carry the reader from the elementary theory all the way to hitherto unpublished research results. |
Contents
Elementary Definitions and Examples | 1 |
E F Assmus Jr and J J Florentin 1 Introduction | 15 |
The Machine Model | 16 |
Copyright | |
44 other sections not shown
Other editions - View all
Common terms and phrases
0-minimal ideal 0-simple a₁ algebraic automata automaton Axiom b₁ C₁ C₂ cascade Chapter combinatorial semigroup commutative compact semigroup component congruence set contains context-free context-free languages coordinate cyclic D₁ defined Definition denote element epimorphism equivalence relation exists f₁ Fact finite semigroups function G₁ G₂ GM semigroup grammar H classes h₁ h₂ Hence idempotent identity IG(S implies induction input integer isomorphism J₁ J₂ kernel Krohn left ideal left simple Lemma machine mapping semigroup Math maximal subgroup multiplication N₁ N₂ noncombinatorial nonempty nonzero null null semigroup P₁ partition permutation PRIMES(S PROOF Proposition prove R₁ Rees matrix semigroup restricted Rhodes S₁ S₂ satisfies Schützenberger semidirect product sequence simple semigroup subsemigroup subset Suppose syntactic monoid T₁ T₂ Theorem theory topological transformation U₁ U₂ union of groups unique wreath product X₁ Y₁ zero