Computer Science Fundamentals
Algorithms
Objective
Mar 05, 2013
If L be a language recognizable by a finite automaton, then language front
{L} = { w such that w is prefix of v where v ∈ L }, is a
Detailed Explanation
Option a is right answer.
Discussion (0)
No comments yet. Be the first to share your thoughts!
Share Your Thoughts