Scribd
Upload
15 views2 pages

IMP Questions

The document outlines various topics related to automata theory, including the conversion of NFAs to DFAs, the construction of DFAs for specific languages, and the definition of pushdown automata. It also includes questions and definitions related to regular expressions, context-free grammars, and properties of languages. Additionally, it addresses concepts such as ambiguity in grammars and the implications of certain theorems in automata theory.

Uploaded by

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

IMP Questions

The document outlines various topics related to automata theory, including the conversion of NFAs to DFAs, the construction of DFAs for specific languages, and the definition of pushdown automata. It also includes questions and definitions related to regular expressions, context-free grammars, and properties of languages. Additionally, it addresses concepts such as ambiguity in grammars and the implications of certain theorems in automata theory.

Uploaded by

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

1) Convert NFA to DFA

2) DFA divisible problem


3) Converting NFA with Epsilon to with out Epsilon
4) Construct DFA for L={0^m1^n|m≥0 and n≥1}
5) Construct DFA for even no.of 0’s & 1’s
6) State pumping lemma to prove {a^p |p is prime number} and L={WW^r / W
is a binary sting} is not regular
7) Construct the Context Free Grammar for the Language L= { 0^2n1^m |
n≥0, m≥0} and L={a^I b^j c^k|i=j}
8) Converting FA to RE
9) Write about Leftmost derivation and rightmost derivation with example.For
a given string construct Leftmost derivation
10) Define Push Down Automata. Explain the basic structure of PDA
with a neat graphical representation.
11) Check whether the given grammar is ambiguous or not
12) PDA Problems

_______________________________________________________________________________

1) What is R+R_________

2) An NFA ‘s transition function returns_______ ?


3) The number of states to accept string “ba” are_______?
4) CFG stands for_________?
5) Any transition graph has an equivalent________?
6) Every NFA accepts a ___________
7) Regular expressions are used to represent which language____________
8) Regular Expression is accepted by ___________?
9) Context free Grammar is accepted by
10) Finite automata can recognize only one type of language and that
is__________
11) The set of strings that ends in 0 is denoted as_____________.
12) In _________, there exists only one transition from a state on an input symbol.
13) A grammar is _____________device.

14) Arden’s theorem states that ______________.


15) In CFG normally the terminals are denoted by ________case and non-terminals are
denoted by ___________ case .

16) Ambiguous if grammar is _________________________.


17) DFA stands for __________.
18) Transition function of NFA is __________________.
19) _____________ denoted any number of zeros followed by any
number of ones followed by any number of twos.
20) Power of DFA and ANFA is________________
21) {L=a^p|P is prime} is a___________language
22) An automata is ____________device and grammar is
_________________device
23) Removing ____________states from a machine M does not affect the
language it accepts
24) Let maximum number of states in DFA=128,then its equivalent NFA
has ____________states
25) The theorem for checking non regularity of a language is ___________
26) In regular expression for adjoining two symbols we use
_________operator
27) In regular expression the null or empty string is denoted
by____________
28) Concatenation of R with Ø gives ____________
29) Ø^*=____________
30) If A and B are regular languages then A^* is________________

________________________________________________________________

You might also like