Question

Consider the following statements . I ) The ARDEN 's lemma can be used for Deterministic finite automata ( DFA ), non - de finite automata ( NFA ) and - NFA . II) The number of DFAs to accept any regular language L is infinite. III) By default, the Turing machine is deterministic in nature.

Answer 1

Answer:

1. किन - किन मैको पर तुम सब मिलकर खाना खाते हो