Page 1 of 1
1. Find CFGs that generate these regular languages over the alphabet Σ = (a b): (i) The language defined by (aaa + b)*.
Posted: Thu May 05, 2022 12:57 pm
by answerhappygod
- 1 (22.68 KiB) Viewed 46 times
1. Find CFGs that generate these regular languages over the alphabet Σ = (a b): (i) The language defined by (aaa + b)*. (ii) The language defined by (a + b)*(bbb + aaa)(a + b)". (iii) All strings without the substring aaa. (iv) All strings that end in b and have an even number of b's in total.