engineering recuitment GATE CSE 2023-24 Test Series Theory of Computation Regular Languages and Finite Automata Finite Automata
Which of the following statements is/are true?
1
The language denoted by the regular expression (ϕ*)* is ϵ
2
The language denoted by the regular expression a ϕ is ϕ
3
The regular expression for the language L={vuv|v,u∈{a,b}*,|v|≤3 } is L=(a+b)*
4
The language denoted by the regular expression (ϕ*)* is ϕ