Which of the technique is used to prove that language is non refular?
Answers
Answered by
1
pumping lemma
Because, we use most powerful technic called pumping lemma, for showing certain languages cannot be regular. we use ardens theorem to find out a regular expression out a finite automaton.
I hope the answer helps you.....
Because, we use most powerful technic called pumping lemma, for showing certain languages cannot be regular. we use ardens theorem to find out a regular expression out a finite automaton.
I hope the answer helps you.....
Similar questions