Test: DFA Processing Strings - Computer Science Engineering (CSE) MCQ

 For a string of n characters with no repetitive substrings, the number of states required to pass the string is n+1.

The Language can be anonymously checked and thus the answer can be predicted. The language needs to be accepted by the automata (acceptance state) in order to prove its regularity.

 Union operation creates the universal set by combining all the elements of first and second set while intersection operation creates a set of common elements of the first and the second state.

Use the equivalence theorem or Myphill Nerode theorem to minimize the DFA

The string a state receives is the combination of all input alphabets which lie across the path covered.

DFA can be made for infinite language with an infinite length. Thus, dependency over length is unfruitful.

It is not possible to have a count of equal number of 0 and 1 at any instant in DFA. Thus, It is not possible to build a DFA for the given Language.

For a string of n characters with no repetitive substrings, the number of states required to pass the string is n+1.