___________ states are called the halt states.

Related MCQs

• Given a Non-deterministic Finite Automation (NFA) with states p and r as initial and final states respectively and transition table as given below: A B P - Q q R S r R S s R S The minimum number of states required in Deterministic Finite Automation (DFA) equivalent to NFA is
• Given an arbitrary non-deterministic finite automaton NFA with N states, the maximum number of states in an equivalent minimized DFA is at least:
• The number of symbols necessary to simulate a Turing machine with m symbols and n states
• 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?
• Consider the regular language L = (111+111111)*. The minimum number of states inany DFA accepting this language is
• The minimum state automaton equivalent to the above FSA has the following number of states
• Let w be any string of length n is {0,1}*. Let L be the set of all substrings of w. What is the minimum number of states in a non-deterministic finite automaton that accepts L?
• Which one of the following statement is true for a regular language L over {a} whose minimal finite state automation has two states?
• Consider the regular language L =(111+11111)*. The minimum number of states in any DFA accepting this languages is:
• Let n be the positive integer constant and L be the language with alphabet {a}. To recognize L the minimum number of states required in a DFA will be