Theory of Computation
Quick practice
Question 1 of 5
Which of the following helps in the conversion of deterministic finite automata into a regular expression?
A
Thompson’s Construction Algorithm
B
Kleene’s Algorithm
C
Floyd-Warshall algorithm
D
None of the above
Get unlimited practice with GATE - CSIT, DSAI & Interview Preparation subscription
Boost your performance with adaptive practice tests
Practice every concept in the syllabus
Compare your speed and accuracy with your peers
Download the app and practice on the go