445 views
1 votes
1 votes

2 Answers

2 votes
2 votes

Option c is right

  •  if a language is regular then there must exist a left linear and right linear grammar .so option a and b is true .

Example : L= a*

Left linear grammar is : s--->aS/null

Right linear grammar is: s---->Sa/null

  • In NFA if there is multiple final state then we can make it single final state . But not in DFA .

  • If a language is regular then there exist a NFA . AND NFA WITH NULL IS EQUIVALENT TO NFA . BECZ CONVERSION IS POSSIBLE . SO OPTION e is also true .

Related questions

0 votes
0 votes
0 answers
1
0 votes
0 votes
1 answer
2
himgta asked Jul 14, 2018
236 views
0 votes
0 votes
1 answer
3
himgta asked Jul 14, 2018
254 views
0 votes
0 votes
2 answers
4
himgta asked Jul 13, 2018
485 views
L = {anbk : | n – k | = 2}L is regular or not?Please provide explanation