Unformatted text preview: is regular. 2) True or false with explanation. The MyhillNerode Theorem says that a language L is regular if and only if L contains a finite number of strings. 3) What should the entries 19 be in the following table? The language in question is {a i b j  i < j}. bb bbb bbbb a 1 2 3 aa 4 5 6 aaa 7 8 9 4) What equivalence classes of {a,b}* defined by the language {a i b j  i < j} are identified by the above table?...
View
Full Document
 Fall '07
 TORNG
 Equivalence relation, Formal language, Axiom

Click to edit the document details