The PDA is called non-deterministic PDA when there are more than one out going edges from……… state

Related MCQs

• The PDA is called non-deterministic PDA when there are more than one out going edges from……… state:
• If G is a simple connected 3-regular planar graph where every region is bounded by exactly 3 edges, then the edges of G is
• If G is a simple connected 3-regular planar graph where every region is bounded by exactly 3 edges, then the edges of G is
• State table of an FSM is given below. There are two states A And B, one input and one output. Let the initial state be A = 0 and B = 0. To take the machine to the state A = 0 and B = 1 with output = 1 the minimum length of input string required will be
• Consider the following statements about the context free grammar G = {S - >SS,S - >ab,S ->ba, S - ε} I. G is ambiguous II. G produces all strings with equal number of a’s and b’s III. G can be accepted by a deterministic PDA. Which combination below expresses all the true statements about G?
• In FA, if one enters in a specific state but there is no way to leave it, then that specific state is called
• Consider the state table of a finite state machine that has input x and a single output z. The shortest input sequence to reach the final state C if the initial state is unknown is
• Which of the following statements are TRUE? (1) The problem of determining whether there exists a cycle in an undirected graph is in P. (2) The problem of determining whether there exists a cycle in an undirected graph is in NP. (3) If a problem A is NP-Complete, there exists a non-deterministic polynomial time algorithm to solve A.
• What is the reason behind a Turing machine is more powerful than finite state machine FSM?
• Consider the NFA M shown below. Let the language accepted by M be L. Let L1 be the language accepted by the NFA M1, obtained by changing the accepting state of M to a non-accepting state and by changing the non-accepting state of M to accepting states. Which of the following statements is true?