CIT 594 NFA Sample Problems
Spring 2006, David Matuszek

Here are some sample input sets for your final (NFA) assignment.

STATE a b c
SYMBOL x y
TRANSITION  a x b    b y c
START a
FINAL c
INPUT x y
STATE a b b2 c c2
SYMBOL x y
TRANSITION  a x a    a x b   a x b2
            b y c2   b y a   b y b   b y c
START a
FINAL c
INPUT x y
INPUT x x y
INPUT x x y y
STATE EvenEven EvenOdd OddEven OddOdd
SYMBOL 0 1
TRANSITION EvenEven 0 OddEven    EvenEven 1 EvenOdd
           OddEven  0 EvenEven   OddEven  1 OddOdd
           EvenOdd  0 OddOdd     EvenOdd  1 EvenEven
           OddOdd   0 EvenOdd    OddOdd   1 OddEven 
START EvenEven
FINAL EvenEven 
INPUT  0 1 0 1
INPUT  0 0 1
INPUT  1 1 0
INPUT
INPUT  0 0 1 0 1 1 0 1 0 1
STATE 0 1 2 3
SYMBOL ( )
TRANSITION  0 ( 1   1 ( 2   2 ( 3
            1 ) 0   2 ) 1   3 ) 2
START 0
FINAL 0
INPUT ( )
INPUT ( ( ) ( ) )
INPUT
INPUT ( ( )
INPUT ( ) ) (
INPUT ( )
STATE start one two three finish fail
SYMBOL a the quick fast lively brown red fox dog
TRANSITION start a one        start the one
           one quick one      one fast one      one lively one
           one quick two      one fast two      one lively two
           two red three      two brown three
           three fox finish   three dog fail
START start
FINAL finish
INPUT a lively quick brown fox
INPUT the lively quick brown fox
INPUT the quick brown fox
INPUT a fast red fox
INPUT the fast lively red fox
INPUT the fast quick red brown fox
INPUT the quick brown dog
STATE 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 
SYMBOL a b c 
TRANSITION  1 a 2    1 a 3
            2 b 4    2 b 5    3 b 6    3 b 7
            4 c 8    4 c 9    5 c 10   5 c 11
            6 c 12   6 c 13   7 c 14   7 c 15
START 1
FINAL 11 14
INPUT a b c
INPUT b a c