COMPUTER SCIENCE AND ENGINEERING
COMPILER DESIGN
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
A Finite Automata recognizes
|
|
Context Free Language
|
|
|
Context Sensitive Language
|
|
|
Regular Language
|
|
|
Any Language
|
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.
Detailed explanation-2: -Explanation: All regular languages are implemented by finite automata.
Detailed explanation-3: -The Wikipedia entry for Regular language states that the all finite languages are regular and that infinite languages are not regular because they cannot be recognized by a finite automaton because the finite automaton has access to a finite quantity of memory.
There is 1 question to complete.