Question 5926 – UGC NET CS 2009-June-Paper-2
March 7, 2024Data-Structures
March 8, 2024Finite-Automata
| Question 1 |
The regular expression for the language recognized by the finite state automaton of figure is __________
| L = 0*1* |
Question 1 Explanation:
L = 0*1*
L contains all binary strings where a 1 is not followed by a 0.
L contains all binary strings where a 1 is not followed by a 0.
Correct Answer: A
Question 1 Explanation:
L = 0*1*
L contains all binary strings where a 1 is not followed by a 0.
L contains all binary strings where a 1 is not followed by a 0.
Subscribe
Login
0 Comments