The following Finite Automaton recognizes which of the given languages?
(A) {1, 0}* {01}
(B) {1, 0}* {1}
(C) {1}{1, 0}* {1}
(D) 1*0* {0, 1}
Answer: (A)
Explanation: Given DFA accepts all string that ending with “01”, so the language should be (0+1)*01.
Option (A) is correct,
Quiz of this Question
Whether you're preparing for your first job interview or aiming to upskill in this ever-evolving tech landscape,
GeeksforGeeks Courses are your key to success. We provide top-quality content at affordable prices, all geared towards accelerating your growth in a time-bound manner. Join the millions we've already empowered, and we're here to do the same for you. Don't miss out -
check it out now!
Last Updated :
16 May, 2018
Like Article
Save Article