Scribd
Upload
20 views2 pages

Sample Question

The document outlines key concepts in automata theory, including definitions of finite automata, non-deterministic finite automata, and the differences between Moore and Mealy machines. It also covers topics such as grammar, regular expressions, Turing machines, and the Pumping Lemma, along with practical exercises for minimizing DFAs and tracing input strings. Additionally, it discusses the notion of ambiguity in context-free languages and provides examples to illustrate these concepts.

Uploaded by

zxcvbnm.we541
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
20 views2 pages

Sample Question

The document outlines key concepts in automata theory, including definitions of finite automata, non-deterministic finite automata, and the differences between Moore and Mealy machines. It also covers topics such as grammar, regular expressions, Turing machines, and the Pumping Lemma, along with practical exercises for minimizing DFAs and tracing input strings. Additionally, it discusses the notion of ambiguity in context-free languages and provides examples to illustrate these concepts.

Uploaded by

zxcvbnm.we541
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

UNIT 1

1 Define Finite Automata.


2 Define Non-Deterministic Finite Automata.
3 With suitable block diagram, explain the model of automata.
4 Consider the given finite state machine,
Check whether the given String is acceptable or
not, aababaab
Write complete sequence of the states you visit while
tracing the input string.
5 Define grammar and find out Language L(G) generated by following
grammar.
S0B, S1A, A0, A0S, A1AA, B1, B1S, B0BB
6 Explain, why we should Minimize a DFA? Use a suitable example to explain
how to minimize a DFA.
7 Define Moore and Mealy Machines and state and explain the difference
between them.
8

Minimize given DFA.

UNIT 2
9 Define Regular Expressions.
10 What are the operators used in RE.
11 Construct the Deterministic finite automaton equivalent to the regular
expression, (0 + 1)*(00 + 11)(0 + 1)* Also minimize the DFA if possible.
12 Define Pumping Lemma. Explain the application of Pumping Lemma with a
suitable example.
13 Define Derivation Tree. What is Leftmost and Rightmost derivation?
14 Find all strings of length 5 or less in the regular set represented by the
following regular expressions (i) b*ab*ab* (ii) (a+b)*aa(a+b)*
UNIT 3
15 Define Turing Machine. Explain Turing machine model
16 Consider the TM description
given in below table. Draw the
computation sequence of the
input string 00.

17 What is ambiguity in Context Free Language? When a CFG is considered


ambiguous.

You might also like