A Language for which no DFA exist is a________
A Language for which no DFA exist is a________ Correct Answer Non-Regular Language
A language for which there is no existence of a deterministic finite automata is always Non Regular and methods like Pumping Lemma can be used to prove the same.
মোঃ আরিফুল ইসলাম
Feb 20, 2025