##### The lexical analysis for a modern computer language such as

The lexical analysis for a modern computer language such as Java needs the power of which one of the following machine models in a necessary and sufficient sense?

(a) Finite state automata

(b) Deterministic pushdown automata

(c) Non-Deterministic pushdown automata

(d) Turing Machine

Finite state automata

lexical analysis is a phase of tokenising the source program .it is not specific to any language ...it needs finite state automata only.