Push Down Automata Questions

MCQ bookmark_border

34.

If the PDA does not stop on an accepting state and the stack is not empty, the string is:

A

rejected

B

goes into loop forever

C

all of the mentioned

D

none of the mentioned

Correct Answer: A

To accept a string, PDA needs to halt at an accepting state and with a stack empty, else it is called rejected. Given a PDA M, we can construct a PDA M

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

35.

A language accepted by Deterministic Push down automata is closed under which of the following?

A

Complement

B

Complement

C

All of the mentioned

D

None of the mentioned

Correct Answer: A

Deterministic Context free languages(one accepted by PDA by final state), are drastically different from the context free languages. For example they are closed under complementation and not union.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

36.

Which of the following is a simulator for non deterministic automata?

A

JFLAP

B

Gedit

C

FAUTO

D

None of the mentioned

Correct Answer: A

JFLAP is a software for experimenting with formal topics including NFA, NPDA, multi-tape turing machines and L-systems.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

37.

Finite-state acceptors for the nested words can be:

A

nested word automata

B

push down automata

C

ndfa

D

none of the mentioned

Correct Answer: A

The linear encodings of languages accepted by finite nested word automata gives the class of

Check Answer report_problem Report forum Discussion