FSM can recognize

Related MCQs

• A FSM can be considered, having finite tape length without rewinding capability and unidirectional tape movement
• Fred created a new automaton model which is a push down automaton but with two stacks and the added ability of having commands which do not read input tape but which can pop from one stack and push into the other.This new automaton can recognize (choose strongest result)
• What is the reason behind a Turing machine is more powerful than finite state machine FSM?
• Basic limitation of FSM is that it
• TM is more powerful than FSM because
• 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
• 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
• Grammars that can be translated to DFAs:
• The …………. is said to be ambiguous if there exist at least one word of its language that can be generated by the different production tree .
• All NonNull words of the CFL can be generated by the corresponding CFG which is in CNF i.e the grammar in CNF will generate the same language except the: