Quote: any finite automaton is a regular set -- closed under disjunction, product, and repetition

Quotation Skeleton

First we define three operations on sets of … shall be the set of tables to which … EF (their product) … E*F (the iterate of E on F … ) shall be the infinite sum of the … … The regular sets (of tables) shall be the … table) and the empty set and which is … and to E*F. … [p. 34] THEOREM 5. In any finite automaton (in … the event represented by a given state existing …   Google-1   Google-2

Copyright clearance needed for quotation.

Related Topics

Group: grammar   (8 topics, 181 quotes)
Topic: pattern matching (42 items)