(A) Standard form
(B) Conversion form
(C) Left most derivation
(D) None of them
Tag: Theory of Automata
The following problem(s) __ is/are called decidable problem(s).
(A) The two regular expressions define the same language
(B) The two FAs are equivalent
(C) Both a and b
(D) None of given
It is very important to determine which sequences of rows do correspond to possible paths through the?
(A) CFG
(B) CFL
(C) PDA
(D) TAPE
Left hand side of a production in CFG consists of:
(A) One terminal
(B) More than one terminal
(C) One non-terminal
(D) Terminals and non-terminals
The language Q is infinite?
(A) True
(B) False
(C) NA
(D) NA
Identify the TRUE statement?
(A) A PDA is non-deterministic, if there are more than one READ states in PDA
(B) A PDA is never non-deterministic
(C) Like TG, A PDA can also be non-deterministic
(D) A PDA is non-deterministic, if there are more than one REJECT states in PDA
The PDA is called non-deterministic PDA when there are more than one out going edges from__ state.
(A) START or READ
(B) POP or REJECT
(C) READ or POP
(D) PUSH or POP
Then the language generated by that CFG is?
(A) Non regular
(B) Infinite
(C) Regular
(D) Finite