Scribd
Upload
17 views2 pages

Assignment 1 TAFL

assignment of tafl

Uploaded by

2999sandhya
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
17 views2 pages

Assignment 1 TAFL

assignment of tafl

Uploaded by

2999sandhya
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Lloyd Institute of Engineering & Technology

Greater Noida, Uttar Pradesh


Department Computer Science & Engineering

ASSIGNMENT NO. 01

Session: 2023-2024 Semester: 4th

Subject Code: KCS402 Subject Name: TAFL

Q1. A) Define NFA and what various points of difference are between NFA and DFA?
B) Differentiate between Mealy and Moore Machine.

Q2. Design FA for ternary number divisible by 5.

Q3. Convert the following NFA { p, q, r, s},{0,1},_ , p,{ q, s} into DFA where _ is given by:

Q4. Minimize the following automata:

Q5. Solve the DFA Construction Problems:


1) Draw a DFA for the language accepting strings ending with ‘01’ over input alphabets
∑={0, 1}
2) Draw a DFA for the language accepting strings starting with ‘00’ or ’11’ over input
alphabets ∑ = {0, 1} ?
3) Draw a DFA for the language accepting even binary numbers strings over input alphabets
∑ = {0, 1} ?
4) Draw a DFA for the language accepting strings containing even number of total zeros
over input alphabets ∑ = {0, 1} ?
5) Draw a DFA for the language accepting strings starting and ending with different
characters over input alphabets ∑ = {0, 1} ?
6) Draw a DFA for the language accepting strings starting and ending with same character
over input alphabets ∑ = {0, 1} ?
7) Draw a DFA for the language accepting strings such that each ‘0’ is immediately
preceded and followed by ‘1’ over input alphabets ∑ = {0, 1} ?
8) Draw DFA that accepts any string which ends with 1 or it ends with an even number of
0’s following the last 1. Alphabets are {0,1}.
9) Construct DFA for anb | n>=0.
10) Draw a DFA for the language accepting strings containing neither ’00’, nor ’11’ as
substring over input alphabets ∑ = {0, 1} ?

Q6. Convert the following Mealy machine into equivalent Moore machine.

Q7. Convert the given Moore machine into its equivalent Mealy machine.

Q8. a) Design a Moore machine for a binary input sequence such that if it has a substring
101, the machine output A, if the input has substring 110, it outputs B otherwise it outputs
C.

b) Design Mealy machine accepting the language consisteing of strings where input
symbols are (a,b) and the strings should end with either aa or bb.

You might also like