Skip to main content
Share Your Experience: Take the 2024 Developer Survey

New answers tagged

1 vote
Accepted

Help regarding a proof in which i am able to prove a regular language $(a(a+b)*)$ as irregular using pumping lemma

This isn't how the Pumping Lemma works. The Lemma states that "if $L$ is regular then for all $w \in L$ there exists factors $w = xyz$ satisfying ...", not "if $L$ is regular then for ...
Knogger's user avatar
  • 1,097
0 votes

Help regarding a proof in which i am able to prove a regular language $(a(a+b)*)$ as irregular using pumping lemma

Every regular expression have an automata recognising it and the same holds for the converse too. Link to a previous post. Regular languages are defined as the language that can be recognized by a ...
0 votes

Decide if some DFA is accepted

Your answer takes care of the first part. See here for more detailed discussion on the topic "Decide whether a DFA accepts the empty language." Now for the second part, minimize the given ...
codeR's user avatar
  • 987

Top 50 recent answers are included