If a DFA has n states and the language contains any string of length n or more, the language is termed as:
Posted: Thu Jul 14, 2022 9:24 am
a) Infinite
b) Empty
c) Non regular
d) None of the mentioned
b) Empty
c) Non regular
d) None of the mentioned