Finite Automata Questions

MCQ bookmark_border

21.

Transition function maps.

A

? * Q -> ?

B

Q * Q -> ?

C

? * ? -> Q

D

Q * ? -> Q

Correct Answer: D

Inputs are state and input string output is states.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

22.

Number of states require to accept string ends with 10.

A

3

B

2

C

1

D

can

Correct Answer: A

This is minimal finite automata.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

23.

Extended transition function is .

A

Q * ?* -> Q

B

Q * ? -> Q

C

Q* * ?* -> ?

D

Q * ? -> ?

Correct Answer: A

This takes single state and string of input to produce a state.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

24.

?*(q,ya) is equivalent to .

A

?((q,y),a)

B

?(?*(q,y),a)

C

?(q,ya)

D

independent from ? notation

Correct Answer: B

First it parse y string after that it parse a.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

25.

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

Correct Answer: C

If automata starts with starting state and after finite moves if reaches to final step then it called accepted.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

26.

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

Correct Answer: A

If a string accepted by automata it is called language of automata.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

27.

Language of finite automata is.

A

Type 0

B

Type 1

C

Type 2

D

Type 3

Correct Answer: D

According to Chomsky classification.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

28.

Finite automata requires minimum _______ number of stacks.

A

1

C

2

D

None of the mentioned

Correct Answer: B

Finite automata doesn

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

29.

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

A

1

B

2

C

3

D

None of the mentioned

Correct Answer: D

No final state requires.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

30.

Regular expression for all strings starts with ab and ends with bba is.

A

aba*b*bba

B

ab(ab)*bba

C

ab(a+b)*bba

D

All of the mentioned

Correct Answer: C

Starts with ab then any number of a or b and ends with bba.

Check Answer report_problem Report forum Discussion