engineering recuitment Beltron Programmer Mock Test 2024 Theory of Computation Regular Languages and Finite Automata Regular Languages
Consider the FA shown in fig below which language is accepted by the FA:
1
(b + a + b)*a
2
b + (a + b)*b
3
b + a*b*
4
b + a*b