Onebyzero Edu - Organized Learning, Smooth Career

👁️ 61 views

University of Barishal

1st Mid Exam

Course Title: Theory of Computation (CSE-3203)

Semester: 6th | Session: 18-19

Time: N/A | Marks: 24.00

Course Teacher: Dr. Md. Manjur Ahmed

Exam Date: July 24, 2023

1) Write any four application of NFA & DFA

Please SUBSCRIBE to view full question

Topics: N/A Solution is Coming!

7 Marks

2) Construct a DFA for the following language L={w | w is a binary string that has been even number of 1s and even numbers of 0s}

Please SUBSCRIBE to view full question

Topics: N/A Solution is Coming!

5 Marks

3) Construct a NFA for the following: Strings where the first symbol is present somewhere later on at least once.

Please SUBSCRIBE to view full question

Topics: N/A Solution is Coming!

5 Marks

4) Write Bad case where states(DFA)>>states(NFA) describe with pigeonhole principle

Please SUBSCRIBE to view full question

Topics: N/A Solution is Coming!

7 Marks