edited by
1,810 views

2 Answers

3 votes
3 votes

Frankly, None is correct. Finite State machine can recognize Regular languages only...That's True.

But Saying that   Finite State machine can recognize languages generated by Regular Grammars Only ----would be wrong...as Some CFG(Type-2), CSG(Type-1), Type-0 Grammars also generate Regular languages. Hence, the "Only" word in Option $C$ makes Option $C$ Wrong.

Answer:

Related questions

1 votes
1 votes
1 answer
1
2 votes
2 votes
1 answer
2
Arjun asked Nov 5, 2017
1,169 views
Which of the following problems is undecidable?To determine if two finite automata are equivalentMembership problem for context free grammarFiniteness problem for finite ...
1 votes
1 votes
2 answers
3
Arjun asked Nov 5, 2017
2,048 views
Pumping lemma for regular language is generally used for provingWhether two given regular expressions are equivalentA given grammar is ambiguousA given grammar is regular...
5 votes
5 votes
1 answer
4
Arjun asked Nov 5, 2017
1,530 views
The logic of pumping lemma is an example of _________IterationRecursionThe divide and conquer principleThe pigeon – hole principle