Scribd
Upload
40 views2 pages

Question Bank1-1

1. The document contains 20 questions about topics related to formal languages and automata theory including: defining strings, languages, alphabets and symbols; designing deterministic finite automata (DFAs); constructing equivalent DFAs from non-deterministic finite automata (NFAs); minimizing DFAs; writing regular expressions; explaining differences between compilers and interpreters; and describing compiler phases. 2. Many questions ask to design DFAs for specific languages over alphabets, construct equivalent DFAs from NFAs, write regular expressions, or explain concepts like finite automata, compilers, and regular expressions. 3. The document covers fundamental concepts in formal languages and automata theory through a variety

Uploaded by

sumona7739
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
40 views2 pages

Question Bank1-1

1. The document contains 20 questions about topics related to formal languages and automata theory including: defining strings, languages, alphabets and symbols; designing deterministic finite automata (DFAs); constructing equivalent DFAs from non-deterministic finite automata (NFAs); minimizing DFAs; writing regular expressions; explaining differences between compilers and interpreters; and describing compiler phases. 2. Many questions ask to design DFAs for specific languages over alphabets, construct equivalent DFAs from NFAs, write regular expressions, or explain concepts like finite automata, compilers, and regular expressions. 3. The document covers fundamental concepts in formal languages and automata theory through a variety

Uploaded by

sumona7739
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

Question Bank

1 Explain the following with examples i) String ii) Language iii) Alphabet iv) Symbol.

2. Design a DFA to accept the following,

L= {w €{a,b}*; w has all strings that ends with substring abb}.

3. Design a DFA to accept the following,

L= {w; where |w| mod 3 =0 where ∑ ={a}}.

4. Consider the following NFA with €- moves construct equivalent DFA. Refer the fig below.

5. Construct an equivalent DFA from the following given NFA using subset construction method.
Refer below

6. Design a deterministic which accept a string containing “the” anywhere in a string of {a-z}, e.g.,
“there” but not “those”.

7.Differentiate between Compiler and Interpreter. Explain all the advantages of Compiler Technology.

8.Demonstrate the various phases of a compiler and show the output of each phase for the
expression position=initial +rate*60.

9. Write RE for the following languages.

i) L= {anbn | m+n is even}

ii)L= {anbm | m ≥ 1, n ≥ 1, nm ≥3}

10. Write regular expressions for the following languages. The set of all strings in which every pair of
adjacent 0’s appear before any pair of adjacent 1’s.
11.Explain Finite automata and give applications of Finite Automata.

12.Infer a DFA to accept strings of a’s and b’s having a sub string aa.

13. Design a DFA to accept L = {w ε {0, 1} *| w contains a substring of two 1’s separated by an odd
number of characters}.

14.Construct the minimized DFA for the following DFA, Reduce it to simpler form.

15. Construct an equivalent DFA from the following NFA using subset construction method.

16. Convert the following Epsilon - NFA to DFA using ECLOSURE method.

17. Write the differences between Compiler and Interpreter. Explain all the advantages of Compiler
Technology.

18. Explain the various phases of a compiler and show the output of each phase for the expression
position=initial +rate*60.

19.Explain the operators of Regular Expressions by taking suitable examples.

20. Design the regular expression for the following

i) language accepting all the string which are starting

with 1 and ending with 0, over ∑ = {0, 1}.

ii) language starting with ‘a’ but not having consecutive b's.

You might also like