The symbols that can’t be replaced by anything are called -----------------

Related MCQs

• The number of symbols necessary to simulate a Turing machine with m symbols and n states
• Which of the following assertions about Turing Machines is true? Blank symbol(s) may occur in the input. At any stage of a computation, there are only finitely many non-blank Symbols on the tape.
• The PDA is called non-deterministic PDA when there are more than one out going edges from……… state:
• Let L be a language defined over an alphabet ∑,then the language of strings , defined over ∑, not belonging to L denoted by LC or L. is called :
• Let L be any infinite regular language, defined over an alphabet Σ then there exist three strings x, y and z belonging to Σ such that all the strings of the form XY^ n Z for n=1,2,3, … are the words in L called
• ___________ states are called the halt states.
• The part of an FA, where the input string is placed before it is run, is called _______
• The PDA is called non-deterministic PDA when there are more than one out going edges from……… state
• If an effectively solvable problem has answered in yes or no, then this solution is called
• In FA, if one enters in a specific state but there is no way to leave it, then that specific state is called