Scribd
Upload
17 views

Automata Assignment 2

This document contains questions about designing finite automata (FAs) and non-deterministic finite automata (NFAs) as well as converting NFAs to deterministic finite automata (DFAs). Specifically, it includes questions about designing FAs and NFAs that accept particular string languages. It also includes questions that involve converting given NFAs into equivalent DFAs. The questions cover topics like designing FAs for languages based on substring inclusion, string length properties, and symbol counts and patterns.

Uploaded by

Sp
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
17 views

Automata Assignment 2

This document contains questions about designing finite automata (FAs) and non-deterministic finite automata (NFAs) as well as converting NFAs to deterministic finite automata (DFAs). Specifically, it includes questions about designing FAs and NFAs that accept particular string languages. It also includes questions that involve converting given NFAs into equivalent DFAs. The questions cover topics like designing FAs for languages based on substring inclusion, string length properties, and symbol counts and patterns.

Uploaded by

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

Assignment#2

THEORY of AUTOMATA & FORMAL LANGUAGE

# Question based upon designing of Finite Automata (Deterministic Finite Automata):

1. Design a FA recognizing the language over {a,b,c,d} which shall accept only those strings in which no
symbol appear in consecutives position.(2008-09)

2. Construct a DFA for the following language: { am bn | m is divisible by 2 and n is divisible by 4.}.

3. Draw the DFA that accepts set for all strings of 0 and 1 that end in the last two same symbols.

4. Draw the DFA that accepts the language L= { a2 n∨n ≥ 1 } .

5. Design a DFA which accepts all those string of a’s and b’s in which number of a’s is even and number
of b’s is divisible by 3.

6. Draw the finite automata which accept all the strings containing both 11 and 010 as substrings.

7. Construct a DFA for the following language that contains the strings ending with 0.

8. Draw the DFA of the following language over {0,1}:

(i). All strings with Even no. of 0’s and even no. of 1’s.

(ii). All strings of length at most 5.

9. Draw the DFA for the following over the set ∑ = {0,1}

(i) L = { w: |w| mod 3=0 }

(ii) L = { w: |w| mod3 >1 }

10. Design a FA to accept the string that always ends with 00.

11. Give the DFA accepting the following language over the alphabet ∑ ¿{a , b }:

L= {w ∈ { a ,b } ∨w=am bn for m, n> 0 }


¿
(i)

(ii) L= { w ∈ { a ,b } ∨w is the string representation of a floating point number } .


¿

##Question based upon designing of Non Deterministic Finite Automata (NDFA):

1. Construct an NFA which recognizes a set of strings Containing three consecutive 0’s and three
consecutive 1’s. Also Correct (convert) this NFA into equivalent DFA . (2008-09)
2. Draw the NFA that accepts set for all strings of 0 and 1 containing 111 as substring and hence convert
this NFA intoDFA.(2009-10)

3. Construct a NFA for the language L which accepts all the strings in which the third symbol from right
end is always ‘a’ over the ∑ ¿{a , b }.
###Question based upon Conversion of NDFA into DFA:

1.Convert the following NFA having r as final stateta a DFA:(2010-11)

Presen Next State


t State a b c ϵ
→p {p} {q} {r}
q {q} {r] {p}
r {r} {q} {p}
2. Convert the following NFA to equivalent DFA:

→p q,s q
*q r q,r
r s p
*s ∅ p
3. Convert the following NFA to a DFA and informally describe the language it accepts:

0 1
p p,q p
q r,s t
r P,r t
s ∅ ∅
t ∅ ∅

You might also like