Recursive method fordefining language is only for regular languages. True False

Question

Recursive method fordefining language is only for regular languages.

True
False aa* = a+?     
True
False
The language equalmeans number of a’s and b’s are equal with nullstring.

True
False If a regular language isempty then we denote it like L = ? (fi).

True
False
Kleene star of {1} generates {1, 11, 111, 1111, 11111……}.

True
False There can be more thanone start states in TG.

True
False

Every NFA can beconverted into FA.  

True
False ? = {aa, b},length(aaaabaabb) = 5.

True
False
If s=abcd is a string defined over ? = {a,bc,d} then reverse of sis dcba.

True
False Recursive method fordefining language is only for regular languages.

True
False aa* = a+?     
True
False
The language equalmeans number of a’s and b’s are equal with nullstring.

True
False If a regular language isempty then we denote it like L = ? (fi).

True
False
Kleene star of {1} generates {1, 11, 111, 1111, 11111……}.

True
False There can be more thanone start states in TG.

True
False

Every NFA can beconverted into FA.  

True
False ? = {aa, b},length(aaaabaabb) = 5.

True
False
If s=abcd is a string defined over ? = {a,bc,d} then reverse of sis dcba.

True
False If a regular language isempty then we denote it like L = ? (fi).

True
False
Kleene star of {1} generates {1, 11, 111, 1111, 11111……}.

True
False There can be more thanone start states in TG.

True
False

Every NFA can beconverted into FA.  

True
False ? = {aa, b},length(aaaabaabb) = 5.

True
False
If s=abcd is a string defined over ? = {a,bc,d} then reverse of sis dcba.

True
False

Explanation / Answer

Dear..,

Recursive method for defining language is only for regularlanguages.

False aa* = a+? true Strings of one or more a's. The language equal meansnumber of a’s and b’s are equal with nullstring False If a regular language isempty then we denote it like L = ? (fi).
False Kleene star of {1} generates {1, 11, 111, 1111, 11111……}.
TRUE There can be more thanone start states in TG.
False Every NFA can beconverted into FA True. ? = {aa, b},length(aaaabaabb) = 5.
False length(aaaabaabb)=6. If s=abcd is a string defined over ? = {a,bc,d} then reverseof s is dcba.

False reverse of string is -- dbca I hope this will helps you. I hope this will helps you.

Related Questions

Navigate

• Browse (All)
• Browse R
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.