VASAVI COLLEGE OF ENGINEERING (Autonomous)
IBRAHIMBAGH, HYDERABAD-31
DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING
ASSIGNMENT – I
Subject: ALC Branch: B.E 3/4 CSE-A
Academic Year: 2024-25 Semester: V
DOI: 24/8/2024 DOS: 2/09/2024
Set-1 (1602-22-733-031 1602-22-733-037 1602-22-733-040 1602-22-733-002 1602-22-733-
001 1602-22-733-036 1602-22-733-005 1602-22-733-007 1602-22-733-057 1602-22-733-022)
Q.No Question BTL Level Mapped
. Marks (1/2/3/4/5/6) CO PO
Give DFA accepting the following languages
over the alphabet {0,1}
a) The set of all strings beginning with 1 when
that is interpreted as a binary integer is a 3 1,2
1. 1 1
multiple of 5.
b) The set of all strings that, when interpreted
in reverse as a binary integer, is divisible by 5
Give DFAs accepting the following languages
over the alphabet {0,1}
a) The set of all strings such that each
block of ve consecutive symbols
contains at least two 0’s
2. b) The set of all strings whose tenth 3 1,2
1 1
symbol from the right end is 1
The set of strings that either begin or end
with 01 (or both with)
Design NFAs to recognize the following sets
of strings
a) abc, abd, and aacd Assume the
alphabet is {a,b,c,d} 3 1,2
3. 2 1
b) 0101,101, and 011
c) ab, bc, and ca Assume the alphabet is
{a, b, c}
Convert each NFA into DFA
Design an NFA that accepts the language
consisting of the set of those string over {a,b}
4 whose third-to-the-last symbol is b.eg; abaa 1 3 1 1,2
and abba are in the language.
Construct a NFA for a language L which
accepts all the strings in which the 3rd symbol
4 from right end is always ‘a’ over {a,b}. Convert 1
3
1
1,2
into DFA
Set-2 (1602-22-733-003 1602-22-733-004 1602-22-733-006 1602-22-733-008 1602-22-
733-009,1602-22-733-010 1602-22-733-011)
Construct N.F.A for the regular expression
1 b+ba*. 3 1,2
1 1
1,2
Design a DFA to accept the language
2 L1 ={α ∈ {a, b, c}∗| α starts and ends with the 3
1 1
same symbol}
Identify the Language accepted by the given
DFA.
3 3 1,2
1 1
Construct a DFA that accepts the set
consisting of all strings with no more than 3 a’s
over the alphabet {a,b}.
4 3 1,2
1 1
Set-3 (1602-22-733-012 1602-22-733-013 1602-22-733-014 1602-22-733-015 1602-22-733-
016,1602-22-733-017 1602-22-733-018)
Convert the following NFA to equivalent DFA.
1 3 1,2
1 1
Find the Epsilon closure of all the states in the
below Automaton. Construct N.F.A for the
following N.F.A- epsilon.
2 3 1,2
1 1
Construct NFA for the following regular
3 expression (ab + aba)*a 3 1,2
1 1
Convert the following NFA to DFA.
4 3 1,2
1 1
Set-4 (1602-22-733-019 1602-22-733-020 1602-22-733-021 1602-22-733-023 1602-22-733-
024,1602-22-733-026 1602-22-733-027)
Design D.F.A to accept strings with c and d
1 3 1,2
such that number of d’s is divisible by 4. 1 1
Identify the Language accepted by the given
2 3 1,2
DFA. 1 1
Design a DFA to accept the set of all strings
3 whose binary interpretation is divisible by 5. 3 1,2
2 1
Construct the transition diagram for the given
transition table of an Automata. And design
the regular expression for the same Automata.
state 0 1
s
→q0 {q0,q1} {q0}
4 3 1,2
1 1
q1 - {q2}
q2 - {q3}
*q3 {q3} {q3}
Set-5 (1602-22-733-028 1602-22-733-029 1602-22-733-030 1602-22-733-032 1602-22-733-
033,1602-22-733-034 1602-22-733-035)
Construct an NFA representing the language
1 given by the regular expression (a+b)*abb. 3 1,2
1 1
Write a regular expression equivalent to the
following NFA.
2 3 1,2
1 1
3 Convert the following NFA to equivalent DFA.
3 1,2
2 1
Identify the Language accepted by the above
DFA.
4 3 1,2
1 1
Set-6 (1602-22-733-038 1602-22-733-039 1602-22-733-041 1602-22-733-042 1602-22-733-
043,1602-22-733-044 1602-22-733-045)
Identify the Language accepted by the given
DFA.
1 3 1,2
1 1
Design a DFA to accept the set of all strings
that don’t contain the substring 110.
2 3 1,2
1 1
Convert the given regular expression into its
equivalent finite state machine design.
3 3 1,2
2 1
Set-7 (1602-22-733-046 1602-22-733-047 1602-22-733-048 1602-22-733-049 1602-22-
733-050, 1602-22-733-051 1602-22-733-052)
Convert the following NFA to its equivalent
DFA.
1 3 1,2
1 1
Write regular expression to denote a language
L which accepts all the strings which begins or
2 3 1,2
ends with either 00 or 11. 1 1
Identify the Language accepted by the given
DFA.
3 3 1,2
1 1
Set-8 ( 1602-22-733-053 1602-22-733-054 1602-22-733-055 1602-22-733-056 1602-22-733-058
1602-22-733-059 1602-22-733-060)
1 3 1,2
1 1
Design a regular expression for language,
L={all strings of a's and b's, where each string
2 3 1,2
has “ab” as substring}. 1 1
Convert the following NFA to its equivalent
3 DFA. 3 1,2
1 1
Design a Finite Automata for regular
expression (0+11)01.If it is an N.F.A with ε-
4 3 1,2
moves , convert it into its equivalent D.F.A. 1 1
Set-9 ( 1602-22-733-061 1602-22-733-062 1602-22-733-063 1602-22-733-064 1602-22-733-301 1602-
22-733-302 1602-22-733-303)
Identify the Language accepted by the given DFA.
1 3 1,2
1 1
Construct a DFA that accepts the set consisting of
all strings with no more than 3 a’s over the
2 3 1,2
alphabet {a,b}. 1 1
Convert the following NFA to DFA.
3 3 1,2
1 1
Convert the following NFA to its equivalent
DFA.
4 1
3
1
1,2
Set-10 (1602-22-733-304 1602-22-733-305 1602-22-733-306 1602-21-733-045)
Design a Finite Automata for regular expression
(0+11)01.If it is an N.F.A with ε-moves , convert it
1 3 1,2
into its equivalent D.F.A. 1 1
Construct the transition diagram for the given
transition table of an Automata. And design the
regular expression for the same Automata.
state 0 1
s
→q0 {q0,q1} {q0}
2 3 1,2
1 1
q1 - {q2}
q2 - {q3}
*q3 {q3} {q3}
Identify the Language accepted by the above DFA.
3 3 1,2
1 1
Design a Finite Automata for regular
expression (0+11)01.If it is an N.F.A with ε-
4 3 1,2
moves , convert it into its equivalent D.F.A. 1 1
