JNU 2018-1 PhD CS
October 26, 2023JNU 2018-1 PhD CS
October 26, 2023JNU 2018-1 PhD CS
|
Question 2
|
Let L be a language that can be recognized by a finite automaton. The language LR consisting of reverse of the elements of L is a
|
regular language
|
|
|
context-free language
|
|
|
context-sensitive language
|
|
|
recursive language
|
Question 2 Explanation:
The language that can be recognized by a finite automata is called regular language.And regular language is closed under reversal
Correct Answer: A
Question 2 Explanation:
The language that can be recognized by a finite automata is called regular language.And regular language is closed under reversal
Subscribe
Login
0 Comments