Visualizing the pumping lemma for regular languages
The pumping lemma for regular languages and its application are among the more difficult concepts students encounter in an introductory theory of computing course. The pumping lemma is used to prove that particular languages are not regular. Traditional methods of teaching the pumping lemma seem ina...
| Main Author: | |
|---|---|
| Language: | en |
| Published: |
2004
|
| Online Access: | http://etd.lib.montana.edu/etd/2004/cogliati/CogliatiJ0805.pdf |