Corollaries Flashcards
1
Q
Corollary One
A
Language is only regular if there exists a total DFSA M such that L(M) = L
2
Q
Corollary Two
A
If M is total DFSA: a string s in L(M) -> s ends in F
3
Q
Corollary Three
A
L is only regular if there exists an NFSA M such that L(M) = L
4
Q
Corollary Four
A
L is regular if there exists a tau-NFSA recognizing the same language
5
Q
Corollary Five
A
Language described by any regular expression is a regular language
6
Q
Corollary Six
A
Any regular language can be described by at least one regular expression
7
Q
Corollary Seven
A
Pumping lemma
