Input | Output |
---|---|
A finite automaton (FA) is an abstract machine that can be used to represent certain forms of computation. <image 1> The above FA identifies which of the following regular expressions? (A) for (B) [a-z][a-z0-9]* (C) ([1-9][0-9]*)|0 (D) none of the above Answer with the option's letter from the given choices directly. No punctuation. | C Expected Answer: C Difficulty: Medium Subfield: Compiler Principle |