A.

Y: 2019-20
Department of Computer Science and Engineering
Regd. No: Y15ACS497
BAPATLA ENGINEERING COLLEGE, BAPATLA
(AUTONOMOUS)
First Assignment Examination Marks:
Class: III/IV B.Tech ( CSE ) - Sec A, B & C – 1st Sem Max.marks : 10 M
Subject: ATFL ( 14CS502 ) Date: 10-08-2019

Answer ONE Question from each unit

SECTION - I 1X5 =5M

1. Prove that If L is accepted by NFA then there exist DFA that accepts L? 5M
OR
2. Convert the following NFA to DFA? 5M

SECTION - II 1X5 =5M

3. Solve the following problems. 5M
a). Construct DFA that accepts the language which contains set of strings with at least
2 a’s followed by at least 3 b’s followed by exactly 3 c’s.
b). Construct NFA which accepts set of strings start with 10.
OR
4. Convert the following epsilon NFA to DFA. 5M
 A.Y: 2019-20
Department of Computer Science and Engineering
Regd. No: Y15ACS546
BAPATLA ENGINEERING COLLEGE, BAPATLA
(AUTONOMOUS)
First Assignment Examination Marks:
Class: III/IV B.Tech ( CSE ) - Sec A, B & C – 1st Sem Max.marks : 10 M
Subject: ATFL ( 14CS502 ) Date: 10-08-2019

Answer ONE Question from each unit

SECTION - I 1X5 =5M

1. Prove that If L is accepted by NFA then there exist DFA that accepts L? 5M
OR
2. Convert the following NFA to DFA? 5M

SECTION - II 1X5 =5M

3. Solve the following problems. 5M
a). Construct DFA that accepts the language which contains set of strings with at least
2 a’s followed by at least 3 b’s followed by exactly 3 c’s.
b). Construct NFA which accepts set of strings start with 10.
OR
4. Convert the following epsilon NFA to DFA. 5M
 A.Y: 2019-20
Department of Computer Science and Engineering
Regd. No: Y15ACS558
BAPATLA ENGINEERING COLLEGE, BAPATLA
(AUTONOMOUS)
First Assignment Examination Marks:
Class: III/IV B.Tech ( CSE ) - Sec A, B & C – 1st Sem Max.marks : 10 M
Subject: ATFL ( 14CS502 ) Date: 10-08-2019

Answer ONE Question from each unit

SECTION - I 1X5 =5M

1. Prove that If L is accepted by NFA then there exist DFA that accepts L? 5M
OR
2. Convert the following NFA to DFA? 5M

SECTION - II 1X5 =5M

3. Solve the following problems. 5M
a). Construct DFA that accepts the language which contains set of strings with at least
2 a’s followed by at least 3 b’s followed by exactly 3 c’s.
b). Construct NFA which accepts set of strings start with 10.
OR
4. Convert the following epsilon NFA to DFA. 5M
 A.Y: 2019-20
Department of Computer Science and Engineering
Regd. No: Y16ACS471
BAPATLA ENGINEERING COLLEGE, BAPATLA
(AUTONOMOUS)
First Assignment Examination Marks:
Class: III/IV B.Tech ( CSE ) - Sec A, B & C – 1st Sem Max.marks : 10 M
Subject: ATFL ( 14CS502 ) Date: 10-08-2019

Answer ONE Question from each unit

SECTION - I 1X5 =5M

1. Prove that If L is accepted by NFA then there exist DFA that accepts L? 5M
OR
2. Convert the following NFA to DFA? 5M

SECTION - II 1X5 =5M

3. Solve the following problems. 5M
a). Construct DFA that accepts the language which contains set of strings with at least
2 a’s followed by at least 3 b’s followed by exactly 3 c’s.
b). Construct NFA which accepts set of strings start with 10.
OR
4. Convert the following epsilon NFA to DFA. 5M
 A.Y: 2019-20
Department of Computer Science and Engineering
Regd. No: Y16ACS507
BAPATLA ENGINEERING COLLEGE, BAPATLA
(AUTONOMOUS)
First Assignment Examination Marks:
Class: III/IV B.Tech ( CSE ) - Sec A, B & C – 1st Sem Max.marks : 10 M
Subject: ATFL ( 14CS502 ) Date: 10-08-2019

Answer ONE Question from each unit

SECTION - I 1X5 =5M

1. Prove that If L is accepted by NFA then there exist DFA that accepts L? 5M
OR
2. Convert the following NFA to DFA? 5M

SECTION - II 1X5 =5M

3. Solve the following problems. 5M
a). Construct DFA that accepts the language which contains set of strings with at least
2 a’s followed by at least 3 b’s followed by exactly 3 c’s.
b). Construct NFA which accepts set of strings start with 10.
OR
4. Convert the following epsilon NFA to DFA. 5M
 A.Y: 2019-20
Department of Computer Science and Engineering
Regd. No: Y16ACS529
BAPATLA ENGINEERING COLLEGE, BAPATLA
(AUTONOMOUS)
First Assignment Examination Marks:
Class: III/IV B.Tech ( CSE ) - Sec A, B & C – 1st Sem Max.marks : 10 M
Subject: ATFL ( 14CS502 ) Date: 10-08-2019

Answer ONE Question from each unit

SECTION - I 1X5 =5M

1. Prove that If L is accepted by NFA then there exist DFA that accepts L? 5M
OR
2. Convert the following NFA to DFA? 5M

SECTION - II 1X5 =5M

3. Solve the following problems. 5M
a). Construct DFA that accepts the language which contains set of strings with at least
2 a’s followed by at least 3 b’s followed by exactly 3 c’s.
b). Construct NFA which accepts set of strings start with 10.
OR
4. Convert the following epsilon NFA to DFA. 5M
 A.Y: 2019-20
Department of Computer Science and Engineering
Regd. No: Y16ACS547
BAPATLA ENGINEERING COLLEGE, BAPATLA
(AUTONOMOUS)
First Assignment Examination Marks:
Class: III/IV B.Tech ( CSE ) - Sec A, B & C – 1st Sem Max.marks : 10 M
Subject: ATFL ( 14CS502 ) Date: 10-08-2019

Answer ONE Question from each unit

SECTION - I 1X5 =5M

1. Prove that If L is accepted by NFA then there exist DFA that accepts L? 5M
OR
2. Convert the following NFA to DFA? 5M

SECTION - II 1X5 =5M

3. Solve the following problems. 5M
a). Construct DFA that accepts the language which contains set of strings with at least
2 a’s followed by at least 3 b’s followed by exactly 3 c’s.
b). Construct NFA which accepts set of strings start with 10.
OR
4. Convert the following epsilon NFA to DFA. 5M
 A.Y: 2019-20
Department of Computer Science and Engineering
Regd. No: Y17ACS515
BAPATLA ENGINEERING COLLEGE, BAPATLA
(AUTONOMOUS)
First Assignment Examination Marks:
Class: III/IV B.Tech ( CSE ) - Sec A, B & C – 1st Sem Max.marks : 10 M
Subject: ATFL ( 14CS502 ) Date: 10-08-2019

Answer ONE Question from each unit

SECTION - I 1X5 =5M

1. Prove that If L is accepted by NFA then there exist DFA that accepts L? 5M
OR
2. Convert the following NFA to DFA? 5M

SECTION - II 1X5 =5M

3. Solve the following problems. 5M
a). Construct DFA that accepts the language which contains set of strings with at least
2 a’s followed by at least 3 b’s followed by exactly 3 c’s.
b). Construct NFA which accepts set of strings start with 10.
OR
4. Convert the following epsilon NFA to DFA. 5M
 A.Y: 2019-20
Department of Computer Science and Engineering
Regd. No: Y17ACS516
BAPATLA ENGINEERING COLLEGE, BAPATLA
(AUTONOMOUS)
First Assignment Examination Marks:
Class: III/IV B.Tech ( CSE ) - Sec A, B & C – 1st Sem Max.marks : 10 M
Subject: ATFL ( 14CS502 ) Date: 10-08-2019

Answer ONE Question from each unit

SECTION - I 1X5 =5M

1. Prove that If L is accepted by NFA then there exist DFA that accepts L? 5M
OR
2. Convert the following NFA to DFA? 5M

SECTION - II 1X5 =5M

3. Solve the following problems. 5M
a). Construct DFA that accepts the language which contains set of strings with at least
2 a’s followed by at least 3 b’s followed by exactly 3 c’s.
b). Construct NFA which accepts set of strings start with 10.
OR
4. Convert the following epsilon NFA to DFA. 5M
 A.Y: 2019-20
Department of Computer Science and Engineering
Regd. No: Y17ACS517
BAPATLA ENGINEERING COLLEGE, BAPATLA
(AUTONOMOUS)
First Assignment Examination Marks:
Class: III/IV B.Tech ( CSE ) - Sec A, B & C – 1st Sem Max.marks : 10 M
Subject: ATFL ( 14CS502 ) Date: 10-08-2019

Answer ONE Question from each unit

SECTION - I 1X5 =5M

1. Prove that If L is accepted by NFA then there exist DFA that accepts L? 5M
OR
2. Convert the following NFA to DFA? 5M

SECTION - II 1X5 =5M

3. Solve the following problems. 5M
a). Construct DFA that accepts the language which contains set of strings with at least
2 a’s followed by at least 3 b’s followed by exactly 3 c’s.
b). Construct NFA which accepts set of strings start with 10.
OR
4. Convert the following epsilon NFA to DFA. 5M
 A.Y: 2019-20
Department of Computer Science and Engineering
Regd. No: Y17ACS518
BAPATLA ENGINEERING COLLEGE, BAPATLA
(AUTONOMOUS)
First Assignment Examination Marks:
Class: III/IV B.Tech ( CSE ) - Sec A, B & C – 1st Sem Max.marks : 10 M
Subject: ATFL ( 14CS502 ) Date: 10-08-2019

Answer ONE Question from each unit

SECTION - I 1X5 =5M

1. Prove that If L is accepted by NFA then there exist DFA that accepts L? 5M
OR
2. Convert the following NFA to DFA? 5M

SECTION - II 1X5 =5M

3. Solve the following problems. 5M
a). Construct DFA that accepts the language which contains set of strings with at least
2 a’s followed by at least 3 b’s followed by exactly 3 c’s.
b). Construct NFA which accepts set of strings start with 10.
OR
4. Convert the following epsilon NFA to DFA. 5M
 A.Y: 2019-20
Department of Computer Science and Engineering
Regd. No: Y17ACS519
BAPATLA ENGINEERING COLLEGE, BAPATLA
(AUTONOMOUS)
First Assignment Examination Marks:
Class: III/IV B.Tech ( CSE ) - Sec A, B & C – 1st Sem Max.marks : 10 M
Subject: ATFL ( 14CS502 ) Date: 10-08-2019

Answer ONE Question from each unit

SECTION - I 1X5 =5M

1. Prove that If L is accepted by NFA then there exist DFA that accepts L? 5M
OR
2. Convert the following NFA to DFA? 5M

SECTION - II 1X5 =5M

3. Solve the following problems. 5M
a). Construct DFA that accepts the language which contains set of strings with at least
2 a’s followed by at least 3 b’s followed by exactly 3 c’s.
b). Construct NFA which accepts set of strings start with 10.
OR
4. Convert the following epsilon NFA to DFA. 5M
 A.Y: 2019-20
Department of Computer Science and Engineering
Regd. No: Y17ACS520
BAPATLA ENGINEERING COLLEGE, BAPATLA
(AUTONOMOUS)
First Assignment Examination Marks:
Class: III/IV B.Tech ( CSE ) - Sec A, B & C – 1st Sem Max.marks : 10 M
Subject: ATFL ( 14CS502 ) Date: 10-08-2019

Answer ONE Question from each unit

SECTION - I 1X5 =5M

1. Prove that If L is accepted by NFA then there exist DFA that accepts L? 5M
OR
2. Convert the following NFA to DFA? 5M

SECTION - II 1X5 =5M

3. Solve the following problems. 5M
a). Construct DFA that accepts the language which contains set of strings with at least
2 a’s followed by at least 3 b’s followed by exactly 3 c’s.
b). Construct NFA which accepts set of strings start with 10.
OR
4. Convert the following epsilon NFA to DFA. 5M
 A.Y: 2019-20
Department of Computer Science and Engineering
Regd. No: Y17ACS521
BAPATLA ENGINEERING COLLEGE, BAPATLA
(AUTONOMOUS)
First Assignment Examination Marks:
Class: III/IV B.Tech ( CSE ) - Sec A, B & C – 1st Sem Max.marks : 10 M
Subject: ATFL ( 14CS502 ) Date: 10-08-2019

Answer ONE Question from each unit

SECTION - I 1X5 =5M

1. Prove that If L is accepted by NFA then there exist DFA that accepts L? 5M
OR
2. Convert the following NFA to DFA? 5M

SECTION - II 1X5 =5M

3. Solve the following problems. 5M
a). Construct DFA that accepts the language which contains set of strings with at least
2 a’s followed by at least 3 b’s followed by exactly 3 c’s.
b). Construct NFA which accepts set of strings start with 10.
OR
4. Convert the following epsilon NFA to DFA. 5M
 A.Y: 2019-20
Department of Computer Science and Engineering
Regd. No: Y17ACS522
BAPATLA ENGINEERING COLLEGE, BAPATLA
(AUTONOMOUS)
First Assignment Examination Marks:
Class: III/IV B.Tech ( CSE ) - Sec A, B & C – 1st Sem Max.marks : 10 M
Subject: ATFL ( 14CS502 ) Date: 10-08-2019

Answer ONE Question from each unit

SECTION - I 1X5 =5M

1. Prove that If L is accepted by NFA then there exist DFA that accepts L? 5M
OR
2. Convert the following NFA to DFA? 5M

SECTION - II 1X5 =5M

3. Solve the following problems. 5M
a). Construct DFA that accepts the language which contains set of strings with at least
2 a’s followed by at least 3 b’s followed by exactly 3 c’s.
b). Construct NFA which accepts set of strings start with 10.
OR
4. Convert the following epsilon NFA to DFA. 5M
 A.Y: 2019-20
Department of Computer Science and Engineering
Regd. No: Y17ACS524
BAPATLA ENGINEERING COLLEGE, BAPATLA
(AUTONOMOUS)
First Assignment Examination Marks:
Class: III/IV B.Tech ( CSE ) - Sec A, B & C – 1st Sem Max.marks : 10 M
Subject: ATFL ( 14CS502 ) Date: 10-08-2019

Answer ONE Question from each unit

SECTION - I 1X5 =5M

1. Prove that If L is accepted by NFA then there exist DFA that accepts L? 5M
OR
2. Convert the following NFA to DFA? 5M

SECTION - II 1X5 =5M

3. Solve the following problems. 5M
a). Construct DFA that accepts the language which contains set of strings with at least
2 a’s followed by at least 3 b’s followed by exactly 3 c’s.
b). Construct NFA which accepts set of strings start with 10.
OR
4. Convert the following epsilon NFA to DFA. 5M
 A.Y: 2019-20
Department of Computer Science and Engineering
Regd. No: Y17ACS526
BAPATLA ENGINEERING COLLEGE, BAPATLA
(AUTONOMOUS)
First Assignment Examination Marks:
Class: III/IV B.Tech ( CSE ) - Sec A, B & C – 1st Sem Max.marks : 10 M
Subject: ATFL ( 14CS502 ) Date: 10-08-2019

Answer ONE Question from each unit

SECTION - I 1X5 =5M

1. Prove that If L is accepted by NFA then there exist DFA that accepts L? 5M
OR
2. Convert the following NFA to DFA? 5M

SECTION - II 1X5 =5M

3. Solve the following problems. 5M
a). Construct DFA that accepts the language which contains set of strings with at least
2 a’s followed by at least 3 b’s followed by exactly 3 c’s.
b). Construct NFA which accepts set of strings start with 10.
OR
4. Convert the following epsilon NFA to DFA. 5M
 A.Y: 2019-20
Department of Computer Science and Engineering
Regd. No: Y17ACS527
BAPATLA ENGINEERING COLLEGE, BAPATLA
(AUTONOMOUS)
First Assignment Examination Marks:
Class: III/IV B.Tech ( CSE ) - Sec A, B & C – 1st Sem Max.marks : 10 M
Subject: ATFL ( 14CS502 ) Date: 10-08-2019

Answer ONE Question from each unit

SECTION - I 1X5 =5M

1. Prove that If L is accepted by NFA then there exist DFA that accepts L? 5M
OR
2. Convert the following NFA to DFA? 5M

SECTION - II 1X5 =5M

3. Solve the following problems. 5M
a). Construct DFA that accepts the language which contains set of strings with at least
2 a’s followed by at least 3 b’s followed by exactly 3 c’s.
b). Construct NFA which accepts set of strings start with 10.
OR
4. Convert the following epsilon NFA to DFA. 5M
 A.Y: 2019-20
Department of Computer Science and Engineering
Regd. No: Y17ACS528
BAPATLA ENGINEERING COLLEGE, BAPATLA
(AUTONOMOUS)
First Assignment Examination Marks:
Class: III/IV B.Tech ( CSE ) - Sec A, B & C – 1st Sem Max.marks : 10 M
Subject: ATFL ( 14CS502 ) Date: 10-08-2019

Answer ONE Question from each unit

SECTION - I 1X5 =5M

1. Prove that If L is accepted by NFA then there exist DFA that accepts L? 5M
OR
2. Convert the following NFA to DFA? 5M

SECTION - II 1X5 =5M

3. Solve the following problems. 5M
a). Construct DFA that accepts the language which contains set of strings with at least
2 a’s followed by at least 3 b’s followed by exactly 3 c’s.
b). Construct NFA which accepts set of strings start with 10.
OR
4. Convert the following epsilon NFA to DFA. 5M
 A.Y: 2019-20
Department of Computer Science and Engineering
Regd. No: Y17ACS529
BAPATLA ENGINEERING COLLEGE, BAPATLA
(AUTONOMOUS)
First Assignment Examination Marks:
Class: III/IV B.Tech ( CSE ) - Sec A, B & C – 1st Sem Max.marks : 10 M
Subject: ATFL ( 14CS502 ) Date: 10-08-2019

Answer ONE Question from each unit

SECTION - I 1X5 =5M

1. Prove that If L is accepted by NFA then there exist DFA that accepts L? 5M
OR
2. Convert the following NFA to DFA? 5M

SECTION - II 1X5 =5M

3. Solve the following problems. 5M
a). Construct DFA that accepts the language which contains set of strings with at least
2 a’s followed by at least 3 b’s followed by exactly 3 c’s.
b). Construct NFA which accepts set of strings start with 10.
OR
4. Convert the following epsilon NFA to DFA. 5M
 A.Y: 2019-20
Department of Computer Science and Engineering
Regd. No: Y17ACS530
BAPATLA ENGINEERING COLLEGE, BAPATLA
(AUTONOMOUS)
First Assignment Examination Marks:
Class: III/IV B.Tech ( CSE ) - Sec A, B & C – 1st Sem Max.marks : 10 M
Subject: ATFL ( 14CS502 ) Date: 10-08-2019

Answer ONE Question from each unit

SECTION - I 1X5 =5M

1. Prove that If L is accepted by NFA then there exist DFA that accepts L? 5M
OR
2. Convert the following NFA to DFA? 5M

SECTION - II 1X5 =5M

3. Solve the following problems. 5M
a). Construct DFA that accepts the language which contains set of strings with at least
2 a’s followed by at least 3 b’s followed by exactly 3 c’s.
b). Construct NFA which accepts set of strings start with 10.
OR
4. Convert the following epsilon NFA to DFA. 5M
 A.Y: 2019-20
Department of Computer Science and Engineering
Regd. No: Y17ACS531
BAPATLA ENGINEERING COLLEGE, BAPATLA
(AUTONOMOUS)
First Assignment Examination Marks:
Class: III/IV B.Tech ( CSE ) - Sec A, B & C – 1st Sem Max.marks : 10 M
Subject: ATFL ( 14CS502 ) Date: 10-08-2019

Answer ONE Question from each unit

SECTION - I 1X5 =5M

1. Prove that If L is accepted by NFA then there exist DFA that accepts L? 5M
OR
2. Convert the following NFA to DFA? 5M

SECTION - II 1X5 =5M

3. Solve the following problems. 5M
a). Construct DFA that accepts the language which contains set of strings with at least
2 a’s followed by at least 3 b’s followed by exactly 3 c’s.
b). Construct NFA which accepts set of strings start with 10.
OR
4. Convert the following epsilon NFA to DFA. 5M
 A.Y: 2019-20
Department of Computer Science and Engineering
Regd. No: Y17ACS532
BAPATLA ENGINEERING COLLEGE, BAPATLA
(AUTONOMOUS)
First Assignment Examination Marks:
Class: III/IV B.Tech ( CSE ) - Sec A, B & C – 1st Sem Max.marks : 10 M
Subject: ATFL ( 14CS502 ) Date: 10-08-2019

Answer ONE Question from each unit

SECTION - I 1X5 =5M

1. Prove that If L is accepted by NFA then there exist DFA that accepts L? 5M
OR
2. Convert the following NFA to DFA? 5M

SECTION - II 1X5 =5M

3. Solve the following problems. 5M
a). Construct DFA that accepts the language which contains set of strings with at least
2 a’s followed by at least 3 b’s followed by exactly 3 c’s.
b). Construct NFA which accepts set of strings start with 10.
OR
4. Convert the following epsilon NFA to DFA. 5M
 A.Y: 2019-20
Department of Computer Science and Engineering
Regd. No: Y17ACS533
BAPATLA ENGINEERING COLLEGE, BAPATLA
(AUTONOMOUS)
First Assignment Examination Marks:
Class: III/IV B.Tech ( CSE ) - Sec A, B & C – 1st Sem Max.marks : 10 M
Subject: ATFL ( 14CS502 ) Date: 10-08-2019

Answer ONE Question from each unit

SECTION - I 1X5 =5M

1. Prove that If L is accepted by NFA then there exist DFA that accepts L? 5M
OR
2. Convert the following NFA to DFA? 5M

SECTION - II 1X5 =5M

3. Solve the following problems. 5M
a). Construct DFA that accepts the language which contains set of strings with at least
2 a’s followed by at least 3 b’s followed by exactly 3 c’s.
b). Construct NFA which accepts set of strings start with 10.
OR
4. Convert the following epsilon NFA to DFA. 5M
 A.Y: 2019-20
Department of Computer Science and Engineering
Regd. No: Y17ACS534
BAPATLA ENGINEERING COLLEGE, BAPATLA
(AUTONOMOUS)
First Assignment Examination Marks:
Class: III/IV B.Tech ( CSE ) - Sec A, B & C – 1st Sem Max.marks : 10 M
Subject: ATFL ( 14CS502 ) Date: 10-08-2019

Answer ONE Question from each unit

SECTION - I 1X5 =5M

1. Prove that If L is accepted by NFA then there exist DFA that accepts L? 5M
OR
2. Convert the following NFA to DFA? 5M

SECTION - II 1X5 =5M

3. Solve the following problems. 5M
a). Construct DFA that accepts the language which contains set of strings with at least
2 a’s followed by at least 3 b’s followed by exactly 3 c’s.
b). Construct NFA which accepts set of strings start with 10.
OR
4. Convert the following epsilon NFA to DFA. 5M
 A.Y: 2019-20
Department of Computer Science and Engineering
Regd. No: Y17ACS535
BAPATLA ENGINEERING COLLEGE, BAPATLA
(AUTONOMOUS)
First Assignment Examination Marks:
Class: III/IV B.Tech ( CSE ) - Sec A, B & C – 1st Sem Max.marks : 10 M
Subject: ATFL ( 14CS502 ) Date: 10-08-2019

Answer ONE Question from each unit

SECTION - I 1X5 =5M

1. Prove that If L is accepted by NFA then there exist DFA that accepts L? 5M
OR
2. Convert the following NFA to DFA? 5M

SECTION - II 1X5 =5M

3. Solve the following problems. 5M
a). Construct DFA that accepts the language which contains set of strings with at least
2 a’s followed by at least 3 b’s followed by exactly 3 c’s.
b). Construct NFA which accepts set of strings start with 10.
OR
4. Convert the following epsilon NFA to DFA. 5M
 A.Y: 2019-20
Department of Computer Science and Engineering
Regd. No: Y17ACS536
BAPATLA ENGINEERING COLLEGE, BAPATLA
(AUTONOMOUS)
First Assignment Examination Marks:
Class: III/IV B.Tech ( CSE ) - Sec A, B & C – 1st Sem Max.marks : 10 M
Subject: ATFL ( 14CS502 ) Date: 10-08-2019

Answer ONE Question from each unit

SECTION - I 1X5 =5M

1. Prove that If L is accepted by NFA then there exist DFA that accepts L? 5M
OR
2. Convert the following NFA to DFA? 5M

SECTION - II 1X5 =5M

3. Solve the following problems. 5M
a). Construct DFA that accepts the language which contains set of strings with at least
2 a’s followed by at least 3 b’s followed by exactly 3 c’s.
b). Construct NFA which accepts set of strings start with 10.
OR
4. Convert the following epsilon NFA to DFA. 5M
 A.Y: 2019-20
Department of Computer Science and Engineering
Regd. No: Y17ACS537
BAPATLA ENGINEERING COLLEGE, BAPATLA
(AUTONOMOUS)
First Assignment Examination Marks:
Class: III/IV B.Tech ( CSE ) - Sec A, B & C – 1st Sem Max.marks : 10 M
Subject: ATFL ( 14CS502 ) Date: 10-08-2019

Answer ONE Question from each unit

SECTION - I 1X5 =5M

1. Prove that If L is accepted by NFA then there exist DFA that accepts L? 5M
OR
2. Convert the following NFA to DFA? 5M

SECTION - II 1X5 =5M

3. Solve the following problems. 5M
a). Construct DFA that accepts the language which contains set of strings with at least
2 a’s followed by at least 3 b’s followed by exactly 3 c’s.
b). Construct NFA which accepts set of strings start with 10.
OR
4. Convert the following epsilon NFA to DFA. 5M
 A.Y: 2019-20
Department of Computer Science and Engineering
Regd. No: Y17ACS539
BAPATLA ENGINEERING COLLEGE, BAPATLA
(AUTONOMOUS)
First Assignment Examination Marks:
Class: III/IV B.Tech ( CSE ) - Sec A, B & C – 1st Sem Max.marks : 10 M
Subject: ATFL ( 14CS502 ) Date: 10-08-2019

Answer ONE Question from each unit

SECTION - I 1X5 =5M

1. Prove that If L is accepted by NFA then there exist DFA that accepts L? 5M
OR
2. Convert the following NFA to DFA? 5M

SECTION - II 1X5 =5M

3. Solve the following problems. 5M
a). Construct DFA that accepts the language which contains set of strings with at least
2 a’s followed by at least 3 b’s followed by exactly 3 c’s.
b). Construct NFA which accepts set of strings start with 10.
OR
4. Convert the following epsilon NFA to DFA. 5M
 A.Y: 2019-20
Department of Computer Science and Engineering
Regd. No: Y17ACS540
BAPATLA ENGINEERING COLLEGE, BAPATLA
(AUTONOMOUS)
First Assignment Examination Marks:
Class: III/IV B.Tech ( CSE ) - Sec A, B & C – 1st Sem Max.marks : 10 M
Subject: ATFL ( 14CS502 ) Date: 10-08-2019

Answer ONE Question from each unit

SECTION - I 1X5 =5M

1. Prove that If L is accepted by NFA then there exist DFA that accepts L? 5M
OR
2. Convert the following NFA to DFA? 5M

SECTION - II 1X5 =5M

3. Solve the following problems. 5M
a). Construct DFA that accepts the language which contains set of strings with at least
2 a’s followed by at least 3 b’s followed by exactly 3 c’s.
b). Construct NFA which accepts set of strings start with 10.
OR
4. Convert the following epsilon NFA to DFA. 5M
 A.Y: 2019-20
Department of Computer Science and Engineering
Regd. No: Y17ACS541
BAPATLA ENGINEERING COLLEGE, BAPATLA
(AUTONOMOUS)
First Assignment Examination Marks:
Class: III/IV B.Tech ( CSE ) - Sec A, B & C – 1st Sem Max.marks : 10 M
Subject: ATFL ( 14CS502 ) Date: 10-08-2019

Answer ONE Question from each unit

SECTION - I 1X5 =5M

1. Prove that If L is accepted by NFA then there exist DFA that accepts L? 5M
OR
2. Convert the following NFA to DFA? 5M

SECTION - II 1X5 =5M

3. Solve the following problems. 5M
a). Construct DFA that accepts the language which contains set of strings with at least
2 a’s followed by at least 3 b’s followed by exactly 3 c’s.
b). Construct NFA which accepts set of strings start with 10.
OR
4. Convert the following epsilon NFA to DFA. 5M
 A.Y: 2019-20
Department of Computer Science and Engineering
Regd. No: Y17ACS542
BAPATLA ENGINEERING COLLEGE, BAPATLA
(AUTONOMOUS)
First Assignment Examination Marks:
Class: III/IV B.Tech ( CSE ) - Sec A, B & C – 1st Sem Max.marks : 10 M
Subject: ATFL ( 14CS502 ) Date: 10-08-2019

Answer ONE Question from each unit

SECTION - I 1X5 =5M

1. Prove that If L is accepted by NFA then there exist DFA that accepts L? 5M
OR
2. Convert the following NFA to DFA? 5M

SECTION - II 1X5 =5M

3. Solve the following problems. 5M
a). Construct DFA that accepts the language which contains set of strings with at least
2 a’s followed by at least 3 b’s followed by exactly 3 c’s.
b). Construct NFA which accepts set of strings start with 10.
OR
4. Convert the following epsilon NFA to DFA. 5M
 A.Y: 2019-20
Department of Computer Science and Engineering
Regd. No: Y17ACS543
BAPATLA ENGINEERING COLLEGE, BAPATLA
(AUTONOMOUS)
First Assignment Examination Marks:
Class: III/IV B.Tech ( CSE ) - Sec A, B & C – 1st Sem Max.marks : 10 M
Subject: ATFL ( 14CS502 ) Date: 10-08-2019

Answer ONE Question from each unit

SECTION - I 1X5 =5M

1. Prove that If L is accepted by NFA then there exist DFA that accepts L? 5M
OR
2. Convert the following NFA to DFA? 5M

SECTION - II 1X5 =5M

3. Solve the following problems. 5M
a). Construct DFA that accepts the language which contains set of strings with at least
2 a’s followed by at least 3 b’s followed by exactly 3 c’s.
b). Construct NFA which accepts set of strings start with 10.
OR
4. Convert the following epsilon NFA to DFA. 5M
 A.Y: 2019-20
Department of Computer Science and Engineering
Regd. No: Y17ACS544
BAPATLA ENGINEERING COLLEGE, BAPATLA
(AUTONOMOUS)
First Assignment Examination Marks:
Class: III/IV B.Tech ( CSE ) - Sec A, B & C – 1st Sem Max.marks : 10 M
Subject: ATFL ( 14CS502 ) Date: 10-08-2019

Answer ONE Question from each unit

SECTION - I 1X5 =5M

1. Prove that If L is accepted by NFA then there exist DFA that accepts L? 5M
OR
2. Convert the following NFA to DFA? 5M

SECTION - II 1X5 =5M

3. Solve the following problems. 5M
a). Construct DFA that accepts the language which contains set of strings with at least
2 a’s followed by at least 3 b’s followed by exactly 3 c’s.
b). Construct NFA which accepts set of strings start with 10.
OR
4. Convert the following epsilon NFA to DFA. 5M
 A.Y: 2019-20
Department of Computer Science and Engineering
Regd. No: Y17ACS545
BAPATLA ENGINEERING COLLEGE, BAPATLA
(AUTONOMOUS)
First Assignment Examination Marks:
Class: III/IV B.Tech ( CSE ) - Sec A, B & C – 1st Sem Max.marks : 10 M
Subject: ATFL ( 14CS502 ) Date: 10-08-2019

Answer ONE Question from each unit

SECTION - I 1X5 =5M

1. Prove that If L is accepted by NFA then there exist DFA that accepts L? 5M
OR
2. Convert the following NFA to DFA? 5M

SECTION - II 1X5 =5M

3. Solve the following problems. 5M
a). Construct DFA that accepts the language which contains set of strings with at least
2 a’s followed by at least 3 b’s followed by exactly 3 c’s.
b). Construct NFA which accepts set of strings start with 10.
OR
4. Convert the following epsilon NFA to DFA. 5M
 A.Y: 2019-20
Department of Computer Science and Engineering
Regd. No: Y17ACS546
BAPATLA ENGINEERING COLLEGE, BAPATLA
(AUTONOMOUS)
First Assignment Examination Marks:
Class: III/IV B.Tech ( CSE ) - Sec A, B & C – 1st Sem Max.marks : 10 M
Subject: ATFL ( 14CS502 ) Date: 10-08-2019

Answer ONE Question from each unit

SECTION - I 1X5 =5M

1. Prove that If L is accepted by NFA then there exist DFA that accepts L? 5M
OR
2. Convert the following NFA to DFA? 5M

SECTION - II 1X5 =5M

3. Solve the following problems. 5M
a). Construct DFA that accepts the language which contains set of strings with at least
2 a’s followed by at least 3 b’s followed by exactly 3 c’s.
b). Construct NFA which accepts set of strings start with 10.
OR
4. Convert the following epsilon NFA to DFA. 5M
 A.Y: 2019-20
Department of Computer Science and Engineering
Regd. No: Y17ACS547
BAPATLA ENGINEERING COLLEGE, BAPATLA
(AUTONOMOUS)
First Assignment Examination Marks:
Class: III/IV B.Tech ( CSE ) - Sec A, B & C – 1st Sem Max.marks : 10 M
Subject: ATFL ( 14CS502 ) Date: 10-08-2019

Answer ONE Question from each unit

SECTION - I 1X5 =5M

1. Prove that If L is accepted by NFA then there exist DFA that accepts L? 5M
OR
2. Convert the following NFA to DFA? 5M

SECTION - II 1X5 =5M

3. Solve the following problems. 5M
a). Construct DFA that accepts the language which contains set of strings with at least
2 a’s followed by at least 3 b’s followed by exactly 3 c’s.
b). Construct NFA which accepts set of strings start with 10.
OR
4. Convert the following epsilon NFA to DFA. 5M
 A.Y: 2019-20
Department of Computer Science and Engineering
Regd. No: Y17ACS548
BAPATLA ENGINEERING COLLEGE, BAPATLA
(AUTONOMOUS)
First Assignment Examination Marks:
Class: III/IV B.Tech ( CSE ) - Sec A, B & C – 1st Sem Max.marks : 10 M
Subject: ATFL ( 14CS502 ) Date: 10-08-2019

Answer ONE Question from each unit

SECTION - I 1X5 =5M

1. Prove that If L is accepted by NFA then there exist DFA that accepts L? 5M
OR
2. Convert the following NFA to DFA? 5M

SECTION - II 1X5 =5M

3. Solve the following problems. 5M
a). Construct DFA that accepts the language which contains set of strings with at least
2 a’s followed by at least 3 b’s followed by exactly 3 c’s.
b). Construct NFA which accepts set of strings start with 10.
OR
4. Convert the following epsilon NFA to DFA. 5M
 A.Y: 2019-20
Department of Computer Science and Engineering
Regd. No: Y17ACS549
BAPATLA ENGINEERING COLLEGE, BAPATLA
(AUTONOMOUS)
First Assignment Examination Marks:
Class: III/IV B.Tech ( CSE ) - Sec A, B & C – 1st Sem Max.marks : 10 M
Subject: ATFL ( 14CS502 ) Date: 10-08-2019

Answer ONE Question from each unit

SECTION - I 1X5 =5M

1. Prove that If L is accepted by NFA then there exist DFA that accepts L? 5M
OR
2. Convert the following NFA to DFA? 5M

SECTION - II 1X5 =5M

3. Solve the following problems. 5M
a). Construct DFA that accepts the language which contains set of strings with at least
2 a’s followed by at least 3 b’s followed by exactly 3 c’s.
b). Construct NFA which accepts set of strings start with 10.
OR
4. Convert the following epsilon NFA to DFA. 5M
 A.Y: 2019-20
Department of Computer Science and Engineering
Regd. No: Y17ACS550
BAPATLA ENGINEERING COLLEGE, BAPATLA
(AUTONOMOUS)
First Assignment Examination Marks:
Class: III/IV B.Tech ( CSE ) - Sec A, B & C – 1st Sem Max.marks : 10 M
Subject: ATFL ( 14CS502 ) Date: 10-08-2019

Answer ONE Question from each unit

SECTION - I 1X5 =5M

1. Prove that If L is accepted by NFA then there exist DFA that accepts L? 5M
OR
2. Convert the following NFA to DFA? 5M

SECTION - II 1X5 =5M

3. Solve the following problems. 5M
a). Construct DFA that accepts the language which contains set of strings with at least
2 a’s followed by at least 3 b’s followed by exactly 3 c’s.
b). Construct NFA which accepts set of strings start with 10.
OR
4. Convert the following epsilon NFA to DFA. 5M
 A.Y: 2019-20
Department of Computer Science and Engineering
Regd. No: Y17ACS552
BAPATLA ENGINEERING COLLEGE, BAPATLA
(AUTONOMOUS)
First Assignment Examination Marks:
Class: III/IV B.Tech ( CSE ) - Sec A, B & C – 1st Sem Max.marks : 10 M
Subject: ATFL ( 14CS502 ) Date: 10-08-2019

Answer ONE Question from each unit

SECTION - I 1X5 =5M

1. Prove that If L is accepted by NFA then there exist DFA that accepts L? 5M
OR
2. Convert the following NFA to DFA? 5M

SECTION - II 1X5 =5M

3. Solve the following problems. 5M
a). Construct DFA that accepts the language which contains set of strings with at least
2 a’s followed by at least 3 b’s followed by exactly 3 c’s.
b). Construct NFA which accepts set of strings start with 10.
OR
4. Convert the following epsilon NFA to DFA. 5M
 A.Y: 2019-20
Department of Computer Science and Engineering
Regd. No: Y17ACS555
BAPATLA ENGINEERING COLLEGE, BAPATLA
(AUTONOMOUS)
First Assignment Examination Marks:
Class: III/IV B.Tech ( CSE ) - Sec A, B & C – 1st Sem Max.marks : 10 M
Subject: ATFL ( 14CS502 ) Date: 10-08-2019

Answer ONE Question from each unit

SECTION - I 1X5 =5M

1. Prove that If L is accepted by NFA then there exist DFA that accepts L? 5M
OR
2. Convert the following NFA to DFA? 5M

SECTION - II 1X5 =5M

3. Solve the following problems. 5M
a). Construct DFA that accepts the language which contains set of strings with at least
2 a’s followed by at least 3 b’s followed by exactly 3 c’s.
b). Construct NFA which accepts set of strings start with 10.
OR
4. Convert the following epsilon NFA to DFA. 5M
 A.Y: 2019-20
Department of Computer Science and Engineering
Regd. No: Y17ACS556
BAPATLA ENGINEERING COLLEGE, BAPATLA
(AUTONOMOUS)
First Assignment Examination Marks:
Class: III/IV B.Tech ( CSE ) - Sec A, B & C – 1st Sem Max.marks : 10 M
Subject: ATFL ( 14CS502 ) Date: 10-08-2019

Answer ONE Question from each unit

SECTION - I 1X5 =5M

1. Prove that If L is accepted by NFA then there exist DFA that accepts L? 5M
OR
2. Convert the following NFA to DFA? 5M

SECTION - II 1X5 =5M

3. Solve the following problems. 5M
a). Construct DFA that accepts the language which contains set of strings with at least
2 a’s followed by at least 3 b’s followed by exactly 3 c’s.
b). Construct NFA which accepts set of strings start with 10.
OR
4. Convert the following epsilon NFA to DFA. 5M
 A.Y: 2019-20
Department of Computer Science and Engineering
Regd. No: Y17ACS557
BAPATLA ENGINEERING COLLEGE, BAPATLA
(AUTONOMOUS)
First Assignment Examination Marks:
Class: III/IV B.Tech ( CSE ) - Sec A, B & C – 1st Sem Max.marks : 10 M
Subject: ATFL ( 14CS502 ) Date: 10-08-2019

Answer ONE Question from each unit

SECTION - I 1X5 =5M

1. Prove that If L is accepted by NFA then there exist DFA that accepts L? 5M
OR
2. Convert the following NFA to DFA? 5M

SECTION - II 1X5 =5M

3. Solve the following problems. 5M
a). Construct DFA that accepts the language which contains set of strings with at least
2 a’s followed by at least 3 b’s followed by exactly 3 c’s.
b). Construct NFA which accepts set of strings start with 10.
OR
4. Convert the following epsilon NFA to DFA. 5M
 A.Y: 2019-20
Department of Computer Science and Engineering
Regd. No: Y17ACS558
BAPATLA ENGINEERING COLLEGE, BAPATLA
(AUTONOMOUS)
First Assignment Examination Marks:
Class: III/IV B.Tech ( CSE ) - Sec A, B & C – 1st Sem Max.marks : 10 M
Subject: ATFL ( 14CS502 ) Date: 10-08-2019

Answer ONE Question from each unit

SECTION - I 1X5 =5M

1. Prove that If L is accepted by NFA then there exist DFA that accepts L? 5M
OR
2. Convert the following NFA to DFA? 5M

SECTION - II 1X5 =5M

3. Solve the following problems. 5M
a). Construct DFA that accepts the language which contains set of strings with at least
2 a’s followed by at least 3 b’s followed by exactly 3 c’s.
b). Construct NFA which accepts set of strings start with 10.
OR
4. Convert the following epsilon NFA to DFA. 5M
 A.Y: 2019-20
Department of Computer Science and Engineering
Regd. No: Y17ACS559
BAPATLA ENGINEERING COLLEGE, BAPATLA
(AUTONOMOUS)
First Assignment Examination Marks:
Class: III/IV B.Tech ( CSE ) - Sec A, B & C – 1st Sem Max.marks : 10 M
Subject: ATFL ( 14CS502 ) Date: 10-08-2019

Answer ONE Question from each unit

SECTION - I 1X5 =5M

1. Prove that If L is accepted by NFA then there exist DFA that accepts L? 5M
OR
2. Convert the following NFA to DFA? 5M

SECTION - II 1X5 =5M

3. Solve the following problems. 5M
a). Construct DFA that accepts the language which contains set of strings with at least
2 a’s followed by at least 3 b’s followed by exactly 3 c’s.
b). Construct NFA which accepts set of strings start with 10.
OR
4. Convert the following epsilon NFA to DFA. 5M
 A.Y: 2019-20
Department of Computer Science and Engineering
Regd. No: Y17ACS560
BAPATLA ENGINEERING COLLEGE, BAPATLA
(AUTONOMOUS)
First Assignment Examination Marks:
Class: III/IV B.Tech ( CSE ) - Sec A, B & C – 1st Sem Max.marks : 10 M
Subject: ATFL ( 14CS502 ) Date: 10-08-2019

Answer ONE Question from each unit

SECTION - I 1X5 =5M

1. Prove that If L is accepted by NFA then there exist DFA that accepts L? 5M
OR
2. Convert the following NFA to DFA? 5M

SECTION - II 1X5 =5M

3. Solve the following problems. 5M
a). Construct DFA that accepts the language which contains set of strings with at least
2 a’s followed by at least 3 b’s followed by exactly 3 c’s.
b). Construct NFA which accepts set of strings start with 10.
OR
4. Convert the following epsilon NFA to DFA. 5M
 A.Y: 2019-20
Department of Computer Science and Engineering
Regd. No: Y17ACS561
BAPATLA ENGINEERING COLLEGE, BAPATLA
(AUTONOMOUS)
First Assignment Examination Marks:
Class: III/IV B.Tech ( CSE ) - Sec A, B & C – 1st Sem Max.marks : 10 M
Subject: ATFL ( 14CS502 ) Date: 10-08-2019

Answer ONE Question from each unit

SECTION - I 1X5 =5M

1. Prove that If L is accepted by NFA then there exist DFA that accepts L? 5M
OR
2. Convert the following NFA to DFA? 5M

SECTION - II 1X5 =5M

3. Solve the following problems. 5M
a). Construct DFA that accepts the language which contains set of strings with at least
2 a’s followed by at least 3 b’s followed by exactly 3 c’s.
b). Construct NFA which accepts set of strings start with 10.
OR
4. Convert the following epsilon NFA to DFA. 5M
 A.Y: 2019-20
Department of Computer Science and Engineering
Regd. No: Y17ACS562
BAPATLA ENGINEERING COLLEGE, BAPATLA
(AUTONOMOUS)
First Assignment Examination Marks:
Class: III/IV B.Tech ( CSE ) - Sec A, B & C – 1st Sem Max.marks : 10 M
Subject: ATFL ( 14CS502 ) Date: 10-08-2019

Answer ONE Question from each unit

SECTION - I 1X5 =5M

1. Prove that If L is accepted by NFA then there exist DFA that accepts L? 5M
OR
2. Convert the following NFA to DFA? 5M

SECTION - II 1X5 =5M

3. Solve the following problems. 5M
a). Construct DFA that accepts the language which contains set of strings with at least
2 a’s followed by at least 3 b’s followed by exactly 3 c’s.
b). Construct NFA which accepts set of strings start with 10.
OR
4. Convert the following epsilon NFA to DFA. 5M
 A.Y: 2019-20
Department of Computer Science and Engineering
Regd. No: Y17ACS563
BAPATLA ENGINEERING COLLEGE, BAPATLA
(AUTONOMOUS)
First Assignment Examination Marks:
Class: III/IV B.Tech ( CSE ) - Sec A, B & C – 1st Sem Max.marks : 10 M
Subject: ATFL ( 14CS502 ) Date: 10-08-2019

Answer ONE Question from each unit

SECTION - I 1X5 =5M

1. Prove that If L is accepted by NFA then there exist DFA that accepts L? 5M
OR
2. Convert the following NFA to DFA? 5M

SECTION - II 1X5 =5M

3. Solve the following problems. 5M
a). Construct DFA that accepts the language which contains set of strings with at least
2 a’s followed by at least 3 b’s followed by exactly 3 c’s.
b). Construct NFA which accepts set of strings start with 10.
OR
4. Convert the following epsilon NFA to DFA. 5M
 A.Y: 2019-20
Department of Computer Science and Engineering
Regd. No: Y17ACS564
BAPATLA ENGINEERING COLLEGE, BAPATLA
(AUTONOMOUS)
First Assignment Examination Marks:
Class: III/IV B.Tech ( CSE ) - Sec A, B & C – 1st Sem Max.marks : 10 M
Subject: ATFL ( 14CS502 ) Date: 10-08-2019

Answer ONE Question from each unit

SECTION - I 1X5 =5M

1. Prove that If L is accepted by NFA then there exist DFA that accepts L? 5M
OR
2. Convert the following NFA to DFA? 5M

SECTION - II 1X5 =5M

3. Solve the following problems. 5M
a). Construct DFA that accepts the language which contains set of strings with at least
2 a’s followed by at least 3 b’s followed by exactly 3 c’s.
b). Construct NFA which accepts set of strings start with 10.
OR
4. Convert the following epsilon NFA to DFA. 5M
 A.Y: 2019-20
Department of Computer Science and Engineering
Regd. No: Y17ACS565
BAPATLA ENGINEERING COLLEGE, BAPATLA
(AUTONOMOUS)
First Assignment Examination Marks:
Class: III/IV B.Tech ( CSE ) - Sec A, B & C – 1st Sem Max.marks : 10 M
Subject: ATFL ( 14CS502 ) Date: 10-08-2019

Answer ONE Question from each unit

SECTION - I 1X5 =5M

1. Prove that If L is accepted by NFA then there exist DFA that accepts L? 5M
OR
2. Convert the following NFA to DFA? 5M

SECTION - II 1X5 =5M

3. Solve the following problems. 5M
a). Construct DFA that accepts the language which contains set of strings with at least
2 a’s followed by at least 3 b’s followed by exactly 3 c’s.
b). Construct NFA which accepts set of strings start with 10.
OR
4. Convert the following epsilon NFA to DFA. 5M
 A.Y: 2019-20
Department of Computer Science and Engineering
Regd. No: Y17ACS566
BAPATLA ENGINEERING COLLEGE, BAPATLA
(AUTONOMOUS)
First Assignment Examination Marks:
Class: III/IV B.Tech ( CSE ) - Sec A, B & C – 1st Sem Max.marks : 10 M
Subject: ATFL ( 14CS502 ) Date: 10-08-2019

Answer ONE Question from each unit

SECTION - I 1X5 =5M

1. Prove that If L is accepted by NFA then there exist DFA that accepts L? 5M
OR
2. Convert the following NFA to DFA? 5M

SECTION - II 1X5 =5M

3. Solve the following problems. 5M
a). Construct DFA that accepts the language which contains set of strings with at least
2 a’s followed by at least 3 b’s followed by exactly 3 c’s.
b). Construct NFA which accepts set of strings start with 10.
OR
4. Convert the following epsilon NFA to DFA. 5M
 A.Y: 2019-20
Department of Computer Science and Engineering
Regd. No: Y17ACS569
BAPATLA ENGINEERING COLLEGE, BAPATLA
(AUTONOMOUS)
First Assignment Examination Marks:
Class: III/IV B.Tech ( CSE ) - Sec A, B & C – 1st Sem Max.marks : 10 M
Subject: ATFL ( 14CS502 ) Date: 10-08-2019

Answer ONE Question from each unit

SECTION - I 1X5 =5M

1. Prove that If L is accepted by NFA then there exist DFA that accepts L? 5M
OR
2. Convert the following NFA to DFA? 5M

SECTION - II 1X5 =5M

3. Solve the following problems. 5M
a). Construct DFA that accepts the language which contains set of strings with at least
2 a’s followed by at least 3 b’s followed by exactly 3 c’s.
b). Construct NFA which accepts set of strings start with 10.
OR
4. Convert the following epsilon NFA to DFA. 5M