CaC book: The NFA could be:
State | a | b | c |
---|---|---|---|
[A] | [BD] | ||
[BD] | [BE] | [C] | |
[BE] | [B] | [CE] | |
[C] | |||
[B] | [B] | [C] | |
[CE] | [E] | ||
[E] | [E] |
A -> a B B -> + A | * A | $ C C -> lambda
State s | lambda-close(s) | eat a | lambda-close after a | eat b | lambda-close after b | eat c | lambda-close after c |
---|---|---|---|---|---|---|---|
A | A | B | A,B | ||||
B | A,B | B | A,B | B,C | A,B,C | ||
C | A,B,C | B | A,B | B,C | A,B,C | C | A,B,C |
In picture form: