Regular Languages

Question

Choose the correct statement:

a) For every regular language, there is right linear and left linear grammar.

b) For every regular language, there is right linear or left linear grammar but not both.

c) Transpose of a regular language is regular.

d) both a and c

Comments

option d

---

Both a and c

Answer 1

D) Both A and C are correct options.

A) Using the DFA we can easily create it's left linear grammar as well as right linear grammar.

C) Transpose of a regular language is just inverting final states to non-final states and vice-versa, which will also be a regular language.

Comments

@sir, can you explain how both(transpose and reverse) are same .

---

I mean some authors use term transpose in place of reversal.

---

@ praveen , thanks sir