6

A Moore machine can be described by a Answer tuple.

Number of final state require to accept in minimal finite automata. None
Number of states require to accept string ends with 10. 3
A DFA is represented by digraphs called finite diagram. False
An automaton that produces outputs based on current input and/or previous
state is called ____________. Transducer
Who is the father of modern computer science? Alan Turing
A grammar is a collection of sentences of finite length all constructed from a
finite alphabet of symbols. False
resent State Next State for Input 0 Next State for Input 1
a blank b
b c blank
c blank blank

a–a–b
b–c–a
c–b–c

There are 5 tuples in finite state machine.

Select one:
True

False
Determine the output of the finite automaton. 010110

All of the following is a regular expression except

[(0+1)-(0b+a1)*(a+b)]*

Languages that are generated by context-free grammars are regular languages

Select one:
True

False

Different symbols and terms to describe CFG’s.

A finite set of alphabet or terminals. Σ

Answer 1
A finite set of productions. P
Answer 2
A finite set of variables. V
Answer 3
A start variable. S
Answer 4

DFA
A language is regular if and only if accepted by .
One of the first programmable electronic computers in 1945.
eniac
Answer:

An algorithms to shampoo your hair.

Rinse
Lather
Repeat

Number of states require to accept string ends with 10.

3
Answer:

Who is the father of modern computer science?

Alan Turing
Answer:

The language L contains all strings over the alphabet {a,b} that begin
a b
with and end with
 Pumping Lemma
is to be applied to show that certain languages are not
regular. It should never be used to show a language is regular.

Regular sets are closed under union,concatenation and kleene closure.

Select one:
True

False

string
AAnswer is a finite sequence of symbols taken from Σ .

There are 5 tuples in finite state machine.

Select one:
True

False

Any set that represents the value of the Regular Expression is called a Property
set.
Select one:
True

False

empty set
The set with no elements is called the and is designated with the
Ø
symbol .

Elimination of productions and symbols is called simplification of

CFGs. Simplification essentially comprises of the following steps:
1. reduction of cfg
2. removal of unit
3. removal of null
 Number of final state require to accept in minimal finite automata.
Select one:
a. none of the mentioned
NO final state requires

b. 2
c. 3

d. 1

It process information in their efforts to eat, survive, and reproduce.

living organisms
Answer:

string
AAnswer is a finite sequence of symbols taken from Σ .

accept
Finite Automata all regular languages and only regular languages

Different approaches to draw a derivation tree:

* Starts from tree leaves. It proceeds upward to the root which
is the starting symbol S Answer 1
Bottom-up Approach

* Starts with the starting symbol S. It goes down to tree leaves Answer 2
using productions. Top-dow n Approach

If a context free grammar G has more than one derivation tree for some
string w ∈ L(G), it is called ________________.
Select one:
a. ambiguous grammar
b. regular grammar

c. context free language

Which among the following is not a part of the Context free grammar tuple?
Select one:
a. Production
b. Start symbol

c. End symbol
 Finite set of symbols called in the input Answer 1
alphabet Σ

Answer 2
Finite series of states
Q

A DFA can be represented by a 5-tuple where:

Q is a finite set of states.
Σ is a finite set of symbols called the alphabet.
δ is the transition function where δ: Q × Σ → Q.
q0 is the initial state from where any input is processed (q0 ∈ Q).
F is a set of final state/states of Q (F ⊆ Q).

A set of strings of a’s and b’s of any length including the null string. So L= { ε, a,
b, aa , ab , bb , ba, aaa…….}, the regular expression is blank .

(a+b)*

A Finite Automaton with null moves (FA-ε) does transit not only after giving input
from the alphabet set but also without any input symbol. This transition without
null move
input is called a .

Question 1
Correct
Mark 1.00 out of 1.00

Flag question

Question text

Z2 uses electricity to convey letters and transmit information quickly in 1844.

Select one:
True
False

Question 2
Incorrect
Mark 0.00 out of 1.00

Flag question

Question text
A formal language is a set of strings, each string composed of symbols from a
language
finite set called .
Question 3
Correct
Mark 1.00 out of 1.00

Flag question

Question text

Sets are usually designated with small letters.

Select one:
True

False
Question 4
Correct
Mark 1.00 out of 1.00

Flag question

Question text

process
Living organismsAnswer information in their efforts to eat, survive, and
reproduce.

Question 1
Correct

Mark 1.00 out of 1.00

Flag question

Question text
dfa
A language is regular if and only if accepted byAnswer .
Question 2
Correct

Mark 1.00 out of 1.00

Flag question

Question text
An NFA-ε is represented formally by a 5-tuple consisting of :
Σ
A finite set of input symbols. Answer 1

A set of final state/states of Q (F⊆Q).

F
Answer 2

An initial state q0 ∈ Q
q0
Answer 3

Q
A finite set of states Answer 4

δ
A transition function δ : Q × (Σ ∪ {ε}) → 2Q. Answer 5

Feedback
Your answer is correct.

Question 3
Correct

Mark 1.00 out of 1.00

Flag question

Question text

A Finite Automaton with null moves (FA-ε) does transit not only after giving input

from the alphabet set but also without any input symbol. This transition without
null move
input is called a .
Feedback
Your answer is correct.

Question 4
Correct

Mark 1.00 out of 1.00

Flag question

Question text
Regular expression Φ* is equivalent to _________ .
Select one:

a. ϵ

b. 0

c. Φ

d. 1
Feedback
Your answer is correct.

Question 5
Correct

Mark 1.00 out of 1.00

Flag question

Question text
Any set that represents the value of the Regular Expression is called a Property
set.
Select one:

True

False

Feedback
regular sets
Question 6
Correct

Mark 1.00 out of 1.00

 Flag question

Question text
Let the class of language accepted by finite state machine be L1 and the class of
languages represented by regular expressions be L2 then __________ .
Select one:

a. L1>=L2

b. L1 U L2 = .*

c. L1=L2

d. L1<L2
Feedback
Your answer is correct.

Question 7
Correct

Mark 1.00 out of 1.00

Flag question

Question text
Pumping Lemma
is to be applied to show that certain languages are not

regular. It should never be used to show a language is regular.

Feedback
Your answer is correct.

Question 8
Correct

Mark 1.00 out of 1.00

 Flag question

Question text
For a regular expression ‘a’, we can construct the following FA:

Select one:

True

False

Question 9
Correct

Mark 1.00 out of 1.00

Flag question

Question text
A set of strings of a’s and b’s of any length including the null string. So L= { ε, a,
b, aa , ab , bb , ba, aaa…….}, the regular expression is blank .

(a+b)* answer

(a+b)*abb (aa)*(bb)*b(aa + ab + ba + bb)*

Feedback
Your answer is correct.

Question 10
Incorrect

Mark 0.00 out of 1.00

 Flag question

Question text
What is the final result after converting the following NFA-ε to NFA without Null
move.

Select one:

a.
b.

c.

Feedback
Your answer is incorrect.