Page 1 of 1
5. (10 pts) Let A, B, and C be languages over 9 = {a,b), where • A consists of all strings over except the first 100. Th
Posted: Sat May 14, 2022 7:58 pm
by answerhappygod
- 5 10 Pts Let A B And C Be Languages Over 9 A B Where A Consists Of All Strings Over Except The First 100 Th 1 (24.6 KiB) Viewed 38 times
5. (10 pts) Let A, B, and C be languages over 9 = {a,b), where • A consists of all strings over except the first 100. That is, list all the strings in lexicographic order {c.a.b. aa, ab, ba, bb....}. take out the first 100 strings, and the remaining strings form A; • B is recognized by an NFA, and • C is a recognized by a PDA. Prove or disprove: ( AB) C is a context-free language. Justify your answer.