The lexical analysis for a modern computer language such as Java needs the power of which among the following machine models is necessary and sufficient sense.

$($i$)$ Finite automaton $($FA$)$

$($ii$)$ Finite state machine $($FSM$)$

Justify your answer

$($GATE $2011)$