| 
|
Quote: one-tape, finite automaton are closed under backward tapes and complex products; forms a Boolean algebra of sets
topics >
all references >
references p-r >
Topic:
formal methods and languages
Quotation Skeleton
It turns out that [definable sets of one-tape, finite automaton] can be actually … if a set of tapes is definable, then … Theorem 5. The class [of definable sets] is a … [p. 121] [As originally proved by Myhill, the definable sets are closed under complex products] By the complex product UV of … in U and y in V. Google-1 Google-2
Copyright clearance needed for quotation.
Topic: formal methods and languages (53 items)