23 pages matching algorithm in this book
Results 1-3 of 23
What people are saying - Write a review
We haven't found any reviews in the usual places.
CONCEPT OF AUTOMATON
SOME SPECIAL CLASSES OF AUTOMATA
9 other sections not shown
algebra of events Algebraic Theory algorithm arbitrary automaton arbitrary element arbitrary finite set arbitrary word assume autom automaton belonging automaton mapping automaton without outputs automorphism automorphism group axiom system called canonical chain event characteristic semigroup clear commutative complete system concept congruence relation conjunctive normal form context-free language defined definite event denote the set direct product disjunctive normal form easily be seen equal equivalent event implication finite automata finite set free semigroup function Furthermore FX(X Gecseg given homomorphic image identity element initial input pole input sign isomorphic Lemma mapping induced Mealy-type automaton metrically complete minimal Moore-type automaton Moreover natural number nilpotent notation one-to-one operation output pole permutation prime implicants proved pushdown automaton quasi-direct product quasi-perfect regular event regular expressions representation represented satisfying Statement structural system subset Supplements and exercises Take an arbitrary theory of automata transition V. M. GluSkov valid vectors wreath product