Teaching Haryana (HPSC) Assistant Professor Mock Test 2025 Theory of Computation Regular Languages and Finite Automata Regular Languages
State whether True or False.
I. If two regular expressions denote the same language, then both are said to be equivalent.
II. The regular expression a* denotes the set of all strings of one or more a’s1
I- True, II – True
2
I – True, II – False
3
I – False, II – True
4
I – False, II – False
5
Question Not Attempted