Question

5. (4 points) Which of the following is a method for showing that a language L is not regular? a) Constructing a finite state automaton recognizing L b) Showing that the opponent can always win the regular expression game for L. c) Showing that the relation NL has infinitely many equivalence classes d) Constructing a push-down automaton recognizing L

0 0
Add a comment Improve this question Transcribed image text
Answer #1

c) is the correct option.

because if L is regular than ≈L has finitely many equivalence classes.

If L is regular, them there is a finite automaton M recon=gnizing L.

Add a comment
Know the answer?
Add Answer to:
Which of the following is a method for showing that a language L is not regular?...
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Not the answer you're looking for? Ask your own homework help question. Our experts will answer your question WITHIN MINUTES for Free.
Similar Homework Help Questions
ADVERTISEMENT
Free Homework Help App
Download From Google Play
Scan Your Homework
to Get Instant Free Answers
Need Online Homework Help?
Ask a Question
Get Answers For Free
Most questions answered within 3 hours.
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT