Scribd
Upload
37 views4 pages

Alc Unit-1 Question Bank

The document is a question bank for the Automata Languages and Computation course at Deccan College of Engineering and Technology, specifically for the Computer Science & Engineering program. It includes short answer and long answer questions covering topics such as non-deterministic finite automata, regular expressions, decision properties of regular languages, and the construction of various types of automata. The questions are designed to test students' understanding of key concepts and applications in the field of automata theory.

Uploaded by

Santhosh Chintu
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
37 views4 pages

Alc Unit-1 Question Bank

The document is a question bank for the Automata Languages and Computation course at Deccan College of Engineering and Technology, specifically for the Computer Science & Engineering program. It includes short answer and long answer questions covering topics such as non-deterministic finite automata, regular expressions, decision properties of regular languages, and the construction of various types of automata. The questions are designed to test students' understanding of key concepts and applications in the field of automata theory.

Uploaded by

Santhosh Chintu
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/ 4

DECCAN COLLEGE OF ENGINEERING AND TECHNOLOGY

COMPUTER SCIENCE & ENGINEERING


BE(CSE A & B) V SEM QUESTION BANK
Automata Languages and computation
UNIT-1
SHORT ANSWER QUESTION (2 M)

1. Define Non deterministic Finite automata.


2. Give examples for Regular expressions.
3. State Pumping lemma for regular expressions.
4. Construct a DFA that accepts all strings of a’s and b’s where each string starts and ends
with a different letter given Σ ={a,b}
5. Define the term ‘Automata’ with an example
6. Distinguish between NFA and DFA.
7. Define Deterministic finite automata.
8. Design a finite automation that accept all string starting with ‘0’ and ending with ‘11’
over the alphabet ={ 0,1}
9. Mention the decision properties of regular languages.
10. Design a DFA that accepts strings containing even no. of 0’s and odd no of 1’s.
11. Define strings, alphabets and languages.
12. Write any two applications of finite automata.
13. Write a regular expression which accepts set of all strings whose Σ ={a,b}
14. Determine an NFA accepting all strings over {0,1} which ends in 1,but do not contain the
substring 00.
15. Construct a DFA for L={w|w mod 5=0}

LONG ANSWER QUESTION


1. (a) obtain a regular expression for the finite automata
(b) define εclosure of a state and explain with a suitable example.
2. Minimize the following DFA

3. (a) construct an ε -NFA for ab(a+b)*ab(a*+b*).


(b) Differentiate between Moore and Mealy machine giving examples.
4. (a)Differentiate between NFA and DFA.
(b)construct a R.E for all strings over Σ ={0,1}
5. Construct a DFA
0 1
q0 q0 q1 q0
q1 Φ q2
q2 Φ q3
* q3 q3 q3
6. Construct DFA For The Language L ={W|W does not contain the substring 110}
7. Design a DFA accepting the set of strings over alphabet Σ={0,1} such that in each
string no. of 0’s is divisible by 5 and number of 1’s is divisible by 3.
8. Obtain a DFA to accept strings of 0’s, 1’s and 2’s beginning with ‘0’ followed by
odd number of 1’s and ending with 2.
9. Convert the following the automata to regular expression

10. State pumping lemma and prove L={0i1i | i>=1} is not regular
11. Construct DFA for{W|W is any string except 11 and 111}where Σ ={0,1}
12. Give є-NFA to accept {0n1n2n |n>=0}
13.Construct DFA equivalent to the NFA’s({p,q,r,s},{0,1}, δ,p,{s}).where δ is definedas
follows:

δ 0 1
P {p,q} p
Q r r
R s -
*S s s
14.Obtain a DFA to accept strings of a’s and b’s having even number of a’s and
b’s.
15.Convert є-NFA to NFA

16.Construct an RE for all strings over Σ={0,1} starting and ending with different symbols
17.What is equivalence and minimization of FA? Explain with an example.

You might also like