Jouf university

College of Computer and Information

Sciences
Department of Computer Science
Theory of computation CIS 312
Academic year 1445 (First semester)

THEORY OF COMPUTATION PROJECT

Student Name
Haneen alrwaly

doctor Name
Muhammad Al-Hafiz
Experiment 1: Finite Automaton construction (FA)

1. Construct an FA over the alphabet {a,b,c}, The set

of strings that contains ab or ba.

2. Multiple run: test your FA on the following set of

strings
3. Highlight the nondeterminism in
your FA

4. Convert your FA to RE
5- Convert your FA to grammar
 Experiment 2: Nondeterministic Pushdown
automaton construction (NDPA)

Design an NDPA for wwR

language L = {wwR w ∈(a, b)+}, i.e.,
L = {aa, bb, abba, aabbaa, abaaba, ......}

Multiple run: choose a suitable set of strings (at least 5 strings)

to perform multiple runs