LEXICAL ANALYSIS
REGULAR EXPRESSIONS AND FINITE AUTOMATA
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
Language of Finite Automata is ____
|
|
Regular
|
|
|
Context Free
|
|
|
Context Sensitive
|
|
|
Natural
|
Explanation:
Detailed explanation-1: -A language is a regular language if there is a finite automaton that recognizes it. For example, this machine recognizes the language of strings that have an even number of zeroes since any string that has an even number of zeroes will go from the start state to an accepting state.
There is 1 question to complete.