Chapter 6 - Disproving Regularity Flashcards
1
Q
What is an irregular language?
A
A language that cannot be read by a computer with a finite amount of memory.
2
Q
What is the pumping lemma?
A
This is a lemma used to determine whether a language is irregular or not.
