- ...problem
- See Hopcroft
and Ullman, pp. 14-15.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
- ...ones
- This description does not match the language accepted by
this FA; A transcription error on my part, no doubt. -- Rich.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
- ...NFAs
- Hopcroft
and Ullman, pp. 26-27
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
- ...FAs
- Hopcroft and
Ullman, pp. 40-41.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
- ...substrings
- See Hopcroft and Ullman, p. 55, theorem 3.1
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
- ...class
- Deepa is interested in
neuron-like signaling and its implications for computation.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
- ...sets
- This is a particularly poorly
documented section; My apologies to E'beth. The discussion of closure
properties is section 3.2 of Hopcroft and Ullman (pp. 58-63) and decision
algorithms is section 3.3 (pp. 63-65)
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
- ...by
- Hopcroft and Ullman,
Section 7.2, p. 148.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.