## Discussion Forum

Que. | 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 |

Answer:Finite state automata |