0 votes 0 votes Consider the language $L=\left\{a^{n} b^{m}: n \geq 4, m \leq 3\right\}$ Which of the following regular expression represents language L? aaaa* $(\lambda+b+b b+b b b)$ aaaaa*$(b+bb+bbb)$ aaaaa *$(\lambda+b+b b+b b b)$ aaaa* $(b+b b+b b b)$ Others ugcnetcse-oct2022-paper1 + – admin asked Oct 23, 2022 • edited Dec 20, 2023 by makhdoom ghaya admin 264 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes (C) ajayraho answered Mar 13 ajayraho comment Share Follow See all 0 reply Please log in or register to add a comment.