Visit : https://hemanthrajhemu.github.

io

Join Telegram to get Instant Updates: https://bit.ly/VTU_TELEGRAM

Contact: MAIL: [email protected]

INSTAGRAM: www.instagram.com/hemanthraj_hemu/

INSTAGRAM: www.instagram.com/futurevisionbie/

WHATSAPP SHARE: https://bit.ly/FVBIESHARE

1|Page https://hemanthrajhemu.github.io

-----------------------------------------------------------------------------------------
AUTOMATA THEORY AND COMPUTABILITY
[As per Choice Based Credit System (CBCS) scheme]
(Effective from the academic year 2017 -2018)

SEMESTER – V
Subject Code 17CS54 IA Marks 40
Number of Lecture Hours/Week 04 Exam Marks 60
-----------------------------------------------------------------------------------------
These Questions are being framed for helping the
students in the “FINAL Exams” Only (Remember for
Internals the Question Paper is set by your respective
teachers). Questions may be repeated, just to show
students how VTU can frame Questions.
- ADMIN
----------------------------------------------------------------------------------------
Module 1
----------------------------------------------------------------------------------------
1. Define the following terms with examples:
i. Alphabet
ii. Power of an alphabet
iii. Concatenation,
iv. Languages (4-Marks) (1a) (Dec.2017/Jan.2018)
2. Draw a DFA to accept strings of a’s and b’s ending with ‘bab’.
(3-Marks) (1b) (Dec.2017/Jan.2018)
3. Convert the following NDFSM (above Figure) to its equivalent
DFSM. (9-Marks) (1c) (Dec.2017/Jan.2018)

https://hemanthrajhemu.github.io
2|Page https://hemanthrajhemu.github.io

4. Draw a DFSM to accept the language,

(3-Marks) (2a) (Dec.2017/Jan.2018)

5. Define distinguishable and indistinguishable states, Minimize
the following DFSM,

i. Draw the table of distinguishable and indistinguishable state for

the automata.
ii. Construct minimum state equivalent of automata. (9-Marks)
(2b) (Dec.2017/Jan.2018)

6. Write differences between DFA, NFA an . (4-Marks)

(2c) (Dec.2017/Jan.2018)

https://hemanthrajhemu.github.io
3|Page https://hemanthrajhemu.github.io

7. With a neat diagram, explain a hierarchy of language classes in

automata theory. (4-Marks) (1a) (June/July 2018)
8. Define deterministic FSM. Draw a DFSM to accept decimal
strings which are divisible by 3. (6-Marks) (1b) (June/July 2018)
9. Convert the following NDFSM to its equivalent DFSM.

Also write transition table for DFSM. (6-Marks) (1c) (June/July 2018)
10. Minimize the following finite automata,

(6-Marks) (2a) (June/July 2018)

11. Construct a mealy machine for the following:
i. Design a mealy machine for a binary. input sequence. Such that,
if it has a substring 101, the machine outputs A. If input has
substring 110, the machine outputs B. Otherwise it outputs C.
ii. Design a mealy machine that takes binary number as input and
produces 2’s complement of that number as output. Assume the
string is read from LSB to MSB and end carry is discarded. (6-
Marks)(2b) (June/July 2018)
12. Convert the following mealy. machine to Moore machine.
(4-Marks) (2c) (June/July 2018)

https://hemanthrajhemu.github.io
4|Page https://hemanthrajhemu.github.io

13. Define the following with example :

i. String
ii. Language
iii. Alphabet
iv. DFSM. (08 Marks) (1a) (Dec.2018/Jan.2019)
14. Design a DFSM to accept each of the following languages :
i. L = {W Є {0, 1}* : W has 001 as a substring}
ii. L = {W Є {a, b} * : W has even number of a’s and even number
of b’s}. (8-Marks) (1b) (Dec.2018/Jan.2019)
15. Define NDFSM. Convert the following NDFSM to its
equivalent DFSM.

(8-Marks) (2a) (Dec.2018/Jan.2019)

16. Minimize the following DFSM.

(8-Marks) (2b) (Dec.2018/Jan.2019)

17. Define the following with an example:

https://hemanthrajhemu.github.io
5|Page https://hemanthrajhemu.github.io

i. Alphabet
ii. Strings
iii. Languages
iv. Power of an alphabet (6-Marks) (1a) (Dec.2018/Jan.2019|10
Scheme)
18. Define DFA. Construct the DFA for the following languages:
i. String of a’s and b’s ending with abb.
ii. L= { w/ |w| mod S=0 } on = { a}. (6-Marks) (1b)
(Dec.2018/Jan.2019|10 Scheme)
19. Convert the following NFA into equivalent DFA

(8-Marks) (1c) (Dec.2018/Jan.2019|10 Scheme)

20. Write the Regular expressions for following languages:
i. L(R)={ w| w Є {0, 1}* with at least 3 consecutive zeros }
ii. L= {anbm | m + n is even} (6-Marks)(2a) (Dec.2018/Jan.2019|10
Scheme)
21. Prove that every language defined by regular expression is also
defined by finite automata. (8-Marks) (2b)
(Dec.2018/Jan.2019|10 Scheme)
22. Convert the following regular expressions to NFA with Є-
Transitions:
i. ab(at+b)*
ii. aa(b + a)* (6-Marks) (2c) (Dec.2018/Jan.2019|10
Scheme)
23. Give Formal definition of DFA. And also Design a DFA to read
a string made up of letters “computer” and recognize the strings
that contains the word “cut” as a substring. (10-Marks) (1a)
(June/July.2017|10 Scheme)
24. Design a DFA to accept strings of a's and b's not ending with
abb. (5-Marks) (1b) (June/July.2017|10 Scheme)

https://hemanthrajhemu.github.io
6|Page https://hemanthrajhemu.github.io

25. Covert the followins NFA to DFA

(5-Marks) (1c) (June/July.2017|10 Scheme)

26. Consider the following Є – NFA

i. Compute the Є -closure of each state

ii. Give the set of all strings of length 3 or less accepted by the
automation.
iii. Convert the automation to DFA. (8-Marks) (2a)
(June/July.2017|10 Scheme)
27. Describe regular expression recursively. Write the regular
expression for the following:
i. Strings of a’s and b’s that do not end with ab over {a, b}*
ii. String of 0s and 1s such that starts and ends with the same
symbol. (6-Marks) (2b) (June/July.2017|10 Scheme)
28. Obtain regular expression from the following DFA using state
elimination method. (6-Marks) (2c) (June/July.2017|10
Scheme)

https://hemanthrajhemu.github.io
7|Page https://hemanthrajhemu.github.io

29. Define Finite automata. Write the application of finite automata.

(5-Marks) (1a) (Dec.2016/Jan.2017|10 Scheme)
30. Design a DFA to accept the following language over the
alphabet {0, 1}.
i. L={(01)i .2j | i>=1,j>=1}
ii. L={∞:|∞|mod3=|∞|mod2} (10-Marks) (1b)
(Dec.2016/Jan.2017|10 Scheme)
31. What is NFA? Explain with example. (5-Marks) (1c)
(Dec.2016/Jan.2017|10 Scheme)
32. Define Regular expression. Find regular expression for the
following languages.
i. L -{an bm : (m+ n)is even}
ii. Strings of a's and b's whose 3rd symbol from right is a. (5-
Marks) (2a) (Dec.2016/Jan.2017|10 Scheme)
33. Consider the following Є-NFA

i. Compute Є-closure of each state

ii. Convert the automata to DFA (10-Marks) (2b)
34. Obtain an Є –NFA for the regular expression a* + b* +c*. (5-
Marks) (2c) (Dec.2016/Jan.2017|10 Scheme)
35. Define the following with examples:
i. Alphabet,
ii. String. (4-Marks) (1a) (June/July.2016|10 Scheme)
36. Define DFA. write the DFA's for the following languages on Σ
= {a, b}. (June/July.2016|10 Scheme)
i. The set of all strings containing the substring ‘ab’.
ii. L: {∞|[∞] mod 3 = 0} (8-Marks) (1b)
(June/July.2016|10 Scheme)
37. Convert the following NFA to its equivalent DFA.

https://hemanthrajhemu.github.io
8|Page https://hemanthrajhemu.github.io

(8-Marks) (1c) (June/July.2016|10 Scheme)

38. Define a regular expression. Also write the regular expressions
for the following languages.
i. The set of all strings ending in the substring ‘00’ on Σ= {0, 1}
ii. L= {anbm|n>=4,m<=3}. (08 Marks) (2a) (June/July.2016|10
Scheme)
39. Prove that every language defined by a regular expression is also
defined by a finite automation. (8- Marks)(2b)
(June/July.2016|10 Scheme)
40. Write the Є-NFA for the regular expression ab(a+b)*. (4-
Marks) (2c) (June/July.2016|10 Scheme)
41. What is Automata? Discuss why study automata. (6-Marks) (1a)
(Dec.2015/Jan.2016|10 Scheme)
42. Mention the differences between DFA. NFA and NFA-Є. (4-
Marks) (1b) (Dec.2015/Jan.2016|10 Scheme)
43. Design a DFA to accept the language L = {W / W is of even
length and begins with 01} (6-Marks) (1c)
(Dec.2015/Jan.2016|10 Scheme)
44. Design the NFA-Є or NFA forthe languages given below:
i. abc, abd and aacd {Assume Σ= a, b, c, d }
ii. {ab, abc}* {Assume Σ= a,b,c}. (4-Marks) (1d)
(Dec.2015/Jan.2016|10 Scheme)
45. Convert the following NFA-e to DFA using "subset construction
scheme. (8-Marks) (Dec.2015/Jan.2016|10 Scheme)

https://hemanthrajhemu.github.io
9|Page https://hemanthrajhemu.github.io

46. Define Regular expression and write regular expression for the
following languages:
i. L={a2n b2m : n>=0, m>=0}
ii. Language over {0, l} having all strings not containing 00. (6-
Marks) (2b) (Dec.2015/Jan.2016|10 Scheme)
47. Convert the regular expression (0+1) 1(0+1) to a NFA-Є. (6-
Marks) (2c) (Dec.2015/Jan.2016|10 Scheme)
----------------------------------------------------------------------------------------
ANSWER SCRIP FOR THESE
QUESTIONS WILL BE UPLOADED ASAP
Visit:
https://hemanthrajhemu.github.io
THANK YOU
----------------------------------------------------------------------------------------

https://hemanthrajhemu.github.io