Scribd
Upload
30 views

Assignment No-3 Fall 2020

This document provides instructions for an assignment on automata theory. It is due on December 12, 2020 and is worth a total of 30 marks. Late submissions will be penalized, with a 25% deduction for one day late and 50% deduction for two days late. No submissions will be accepted after two days late. The assignment contains three questions: the first asks to convert a finite state machine to a regular expression; the second asks to convert a non-deterministic finite automaton to a deterministic finite automaton; and the third asks to convert a non-deterministic finite automaton with epsilon transitions to a deterministic finite automaton.

Uploaded by

TALHA SALEEM
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
30 views

Assignment No-3 Fall 2020

This document provides instructions for an assignment on automata theory. It is due on December 12, 2020 and is worth a total of 30 marks. Late submissions will be penalized, with a 25% deduction for one day late and 50% deduction for two days late. No submissions will be accepted after two days late. The assignment contains three questions: the first asks to convert a finite state machine to a regular expression; the second asks to convert a non-deterministic finite automaton to a deterministic finite automaton; and the third asks to convert a non-deterministic finite automaton with epsilon transitions to a deterministic finite automaton.

Uploaded by

TALHA SALEEM
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Theory of Automata

Assignment # 3
Due Date: 12/12/2020 Total Marks: 30

Program: BSCS
Instructions
1. Understanding of the problems is part of the assignments. So no query please.
2. You will get Zero marks if found any type of cheating.
3. 25 % deduction of over marks on the one day late submission after due date
4. 50 % deduction of over marks on the two day late submission after due date
5. No submission after two days.

Q No 1. Suppose qo is a start state and convert this machine into equivalent Regular
expression (All steps are required). 10- Marks

Q No 2. Convert the following NFA into equivalent DFA (All steps are required). 10- Marks
Q No 3. See the following NFA with null transition and convert it into equivalent DFA (All
steps are required). 10- Marks

You might also like