Scribd
Upload
34 views

Question Bank FLAT

Uploaded by

trenjadu
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
34 views

Question Bank FLAT

Uploaded by

trenjadu
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

 Design a DFA which accepts all strings with exactly one ‘a’ defined

over the input alphabet ∑ = {a, b}.


 Design a DFA which accepts all strings with no more than three a’s
defined over the input alphabet ∑ = {a, b}.
 Construct a DFA that accepts all strings over {a,b} ending with ab.
 What is regular grammar. Define with example. Construct a context-
free grammar for the language L = (an b2n | n>=1 }
 What is regular grammar. Define with example. Construct a context-
free grammar for the language L = {anbm : n ≤ m + 3}
 Convert the following Context-free grammar into an
equivalent grammar in CNF
S → 1A /0B
A → 1AA /0S /0
B → 0BB /1S /1

 Convert to Chomskey Normal Form.


S  ABa
A  aab
B  Ac
 Show that the following grammar is ambiguous

 Is the following machine information lossless? If yes, find the


order of losslessness.
NS, z
PS X=0 X=1
A A, 0 B, 0
B C, 0 D, 0
C D, 1 C, 1
D B, 1 A, 1

 Construct an pda that accepts the language L = {anbn : n ≥ 0}.


 Construct DFA for the given NDFA

 Find an pda on Σ = {a, b, c} that accepts the language

 What is parse tree, explain with example.


 Design a TM that can multiply an integer ( >=1 ) by 2, i.e. if input is
b000b then the output will be b000000b.
 Design a TM {anbn | n>=1}
 Pumping Lemma for Context Free Languages

a) L={a^nb^nc^n: n>=0 } is not CFL.

b) L={a^n!} is not CFL.

 What is universal TM. Explain with figure.


 Find the minimum state automaton for the transition diagram given below
FA
 Convert the given mealy machine into an equivalent moore machine

 Prove that (a+b)*=a*(ba*)*



Convert the following Mealy Machine to Moore Machine.

 Does the machine have a finite output memory? If yes, find the order λ. Is
the machine information lossless of finite order? If yes, find the order μ.

 The machine produced an output sequence Z = 0101000. What is the


corresponding input sequence? Is it unique?
 Find the regular expression for given FSM

 Let G be the grammar.


Find the leftmost derivation, rightmost derivation and parse tree for string
001222.
G:S→0S |1A|2B|ϵG:
S→0S |1A|2B|ϵ
A→1A |2B|ϵ
A→1A |2B|ϵ
B→2B|ϵ

 Consider the following grammar and prove that it is an ambiguous


grammar.

E → E + E / E x E / id

 Construct a derivation tree for the string aabbabba for the CFG given by,

S → aB | bA

A → a | aS | bAA B → b | bS | Abb

 Construct Turing machines that will accept the following languages on


{a, b,c}.

L = {anbncn : n ≥0}.

L = {anb2n: n ≥ 1}

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy