Automata Sanjay Sir MCQ

You might also like

Download as pdf or txt
Download as pdf or txt
You are on page 1of 8

0

0
10.
- 0

0
11. 0
-
which do not have two
12. L(M)= set of all string on {0, 1
successive l's.

13. The languageis L ={1lw: w is any string on {0,1

III. Multiple Choice QuestionS

DFA then is
1. If M =(Q.E, 8, go, F) is a

(b) initial state


(a) set of states
(d) alphabet
(c) find state

2. A DFA accepts every language


(b) False
(a) True
3. If M = ( . , 8, qo» F ) is a DFA then state which one o

following is not true


(a) FcQ (b) 9o c
(c)8 is a mapping a)QnE
is
alphabet
the
4.If M =
(Q.2, 8, go, F) be a automata then
(a) Q

(c)8 (d) F
AUTOMAT

259
&If
M=(.2, (9.E.o, qo. F) be a automata then is a
where A
mapping
8:AQ =

(a)Q b)
(c) QxF
(d) Q
6.1f M=(Q, L, 0, 9o, F) 18 a automata then a string w is a

acepted if 8 (G0, 1w) e


(a) E (6)Q
(c) F (d) none of these
0
1.For the DFA 90
OD0,1 6q1,0) =
(a) 9o b) f4o 91
c)1 (d)G1
8. The automata
a,bis a
(a)DFAcoa b) NFA

9. The automata
Taccepts

the string
(a) 11 (b) 01

e) 00 (d) none of these


10. A
Tegular language is accepted by
(a) every DFA (b) every NFA

c)no DFA (d) at least one DFA


260 BCA MATHEMATICS

11. Ifa language Lis accep ted by an automata M the

(a) every string in L is accepted by M


b) at least one string in L is accepted by M

no string of Lis accepted by M


@only one string of L is accepted by M.

12 is a

(a) DFA b) NFA

13. The automata 0 0,1

acoepts the string

a)10 b)01
111 (d) none of these

14. Por the automata. a(1. 1)=


1

none of these
AUTOMATA 261

16,If w e L(M) where L is a language associated with the


nutomata M then uw.

(a) accepted by M
(b) rejected by M.
automata
(rejected by every
automata
(d)accepted by every
automata ({a,4a} la, b},1,6, 141}).If 42 is atrap state
16,Fora
then ö(q2, a)
(b) 1
(a) 42
(d) none of these. 0

Answer

3.b 4. ba 5. d
1. d 2. b
8. b 9. c 10.d
6. c 7.d
13. b 14. c 1 5 .b
12. a
11.a
16. a
BCA MATHEMATICS
2S0
MEALY
other Alachine are also possible
Beside this

7. So. ,y}{0, 1,
not final state. Th ternal
there is 6. In thee

x) S1 : flS2.3) =sg;gls. o
:ss.)=s,
=

states are Sg,S1.Sa, S3.54if(S3,

Multiple Choice Questions

model of a Mealy Machineis a the outp


1. The mathematical
(a)5-tuple b)4-tuple
() none of these
6-tuple

2.1f M, =(so.5,}. {0, 1},{z3},5,5g,2) be a Mealy Machine 7. In th


then fso. Sl is

(a) alphabet b) internal state-set


t h e out
d) none ofthese
C)Output
3. If S is the set of internal states of a Mealy Machine on the
alphabet and output set A then the domain of the transition
function is 8.If M

(a) S 6)E

x Sx
4. If M, ={0.EA,8,go.A} then the domain of the output
mapping is
9.If
(a) Qx b)Exe then
(c) QxQ

5.If8 istransition function ofa Mealy Machine then forany s te


q and input a, 8q, a) 10.In
SP
=

(a) an output b) a state


(c)an input d) none of these
MATHEMATICS-I MEALY ML1CI
&MOORE MACHIINE
The internal 6. In the fealay Machine 231
S4: g(S4. y) =
s 71
a/0

ns
b/1
alo
b71
is a the output obtai d when the
(a) 0 machine moves from
ple q to g, is
(c) 00 b)1
eof these
(d) 11
ealy Machine /0 all
7. In the Mealay Machine
So) D.b/0
rnal state-set
the output (61,a) is a/2
eof these
y Machine on the (a) 0
(6) 1
n of the transition (C) 2
(d) none of these
&fM ((s0, S1}, {0,1), {zy}, ö, sg,A) be a
Mealay Machine then

(a) {0,1)
ain of the output
() {z,} c) none of these

M=(a, {2,3,{4, B,c),,a, 1) be a Mealay Machine


hen b,3) E
a) {A, B,C)
e then for any state
(6 fa, b

In a),y (d) none of these


ate Mealay machine
a) a state
an output is obtained correspondingto
e of these (b) an input
9 a state and an input symbol (d) two states
BC MATHEMATICS.
282

11. 1f the length of the input string is 10 then the le MEALY MICHIN
output string given by
a Mealay Machineis ength of the 19. ff M, = ( :
(a) 9 b) 10 belongs to
(c) 11 (d) 12
12. The mathematical model of a Moore Machine is a (a)
(a) 4-tuple (b) 5-tuple (c) A

)6-tuple d) 7-tuple 20. In a MooreM-


13. If Mo (Q, E, A, 8,q0,4) be a Moore Machine then (a) pair o
=

is
(a) alphabet (b) set of states (c) state
21. If an input st
(c)output (d) transition function then the consum
14. If 8 transition function of a Moore Machine
is a
then the Co (a) the le
domain of 5 is
b) the ri
(a) set of output (b) set of internal states
(c) alphabet (d) none of these C)any s
15. The initial state in a Moore Machine is an element of the set of d) nonee
a) all internal states b) alphabet 22. If the length
c)set of output is 15 then the len
Cset of final states
16. The domain of the output function in a
set of Moore Machine is the (a) 14
16
(a) output (b) all inputs
C) internal states 23. If (4o.71l
(d) none of these
17. 1f Sis set of all
internal states, alphabet and Ais set or
is
olg1.x) belongs t
all outputs and if 8a, b) =c (where 8 is the transition funct (a)o 9
then (a, b) belongs to {1,3}
(a) Ex
(b) Ax
(c) SxA
d) SxE
18. If Mo 1.c
=

(Q,Z,4,8,40,) is a Moore Machine then 8.b


2.b
(a) 1':Ex A A 9.a
b) A: E 15.a
(c):QA 16.c
e d) none of these 22. 23. a
LTHEMATICS-1 MEAL 1CHINE &MoORE
he
length of the MACHINENE
-
19. If Mo= (Q.E, A, ö,
belongs too 9o.) is a
Moore
283

(a)Q
Machine then
2/)
is a
()A (b)E
20. In Moore Machine an output is
a d) none of
these
(a) pair of obtained
e then i (c) state
input, output corresponding
(b) pair of
to a

input, state.
states (d) input
21..lf an input stringiis given to be
symbolsprocessed
tion function then the consumpti of the in a
starts from Moore Machine
hine then the co- (a) the left most
symbol of the string
(b) the right most symbol of the
string
internal states )any symbol of the string
of these (d) none ofthese
ement of the set of
1f the length of the input string processed in a
bet l5 then the length of the Moore Machine
final states
output string is
(a) 14 b) 15
Machine is the
re C)16 (d) 17

puts . IF ((o.91lfa.x}, {1,3), 8,g1, A') be a Moore Machine then


ofthese
set of
Be.) belongs to
and A is
Det (a) (go.1 6){a,x}
ransition function)

(13 ()

Answers

6.b 7.c
2.b 3.d 4.a 5.b
ine then 13.a 14.b
9.a 10.c 11.b 12.c
20.c 21.a
16.c 17.d 18.c 19.c
2.e
e of these 23. a

You might also like