Finite Automata
1.

There are ________ tuples in finite state machine.
A.  

4

 B.  

5

 C.  

6

 D.  

unlimited
2.

Transition function maps.
A.  

Σ * Q -> Σ

 B.  

Q * Q -> Σ

 C.  

Σ * Σ -> Q

 D.  

Q * Σ -> Q
3.

Number of states require to accept string ends with 10.
A.  

3

 B.  

2

 C.  

1

 D.  

can’t be represented.
4.

Extended transition function is .
A.  

Q * Σ* -> Q

 B.  

Q * Σ -> Q

 C.  

Q* * Σ* -> Σ

 D.  

Q * Σ -> Σ
5.

δ*(q,ya) is equivalent to .
A.  

δ((q,y),a)

 B.  

δ(δ*(q,y),a)

 C.  

δ(q,ya)

 D.  

independent from δ notation
6.

String X is accepted by finite automata if .
A.  

δ*(q,x) E A

 B.  

δ(q,x) E A

 C.  

δ*(Q0,x) E A

 D.  

δ(Q0,x) E A
7.

Languages of a automata is
A.  

If it is accepted by automata

 B.  

If it halts

 C.  

If automata touch final state in its life time

 D.  

All language are language of automata
8.

Language of finite automata is.
A.  

Type 0

 B.  

Type 1

 C.  

Type 2

 D.  

Type 3
9.

Finite automata requires minimum _______ number of stacks.
A.  

1

 B.  

0

 C.  

2

 D.  

None of the mentioned
10.

Number of final state require to accept Φ in minimal finite automata.
A.  

1

 B.  

2

 C.  

3

 D.  

None of the mentioned