Escolar Documentos
Profissional Documentos
Cultura Documentos
Computing Theory
Coursework
Learning Outcomes
Assessment Criteria
IMPORTANT: This is an individual assignment, all submitted components must be
your own work or appropriately accredited.
Referencing Code
If you use design or ideas from external sources like book/ magazine/ internet/forum,
then proper citation should be done using the Harvard Name convention within your
solution. Failure to reference design/ideas properly is considered as plagiarism.
Design a Non- Deterministic Finite Automata that accepts ={0,1}. The Non-
Deterministic Finite Automata should be able to determine all strings that have at most
two zeroes and at least two ones. Construct the state transition table for the Automata.
Explain the correctness of the proposed Automata with sample strings that are accepted
and rejected by the State Machine.
Sample Data Accepted by the Automata :
101101
0111
11
PART B:
Construct a Regular Expression for the given NFA by using State Elimination
method. Provide proper explanation for each step mentioning the rules applied
for eliminating a state.
DELIVERABLES
Documentation (hardcopy)
1. Cover page
2. Table of contents
3. Introduction
4. Explanations :
Part A: State Transition Table, NFA diagram, List of acceptable inputs.
Part B: Step by Step evaluation of state elimination method including the
rules.
5. Conclusion
6. References
CD Content (softcopy)
1. Documentation report (.docx/.doc/.rtf)