Related Questions

Assume the statements S1 and S2 given as: S1: Given a context free grammar, there exists an algorithm for determining whether L (G) is infinite. S2: There exists an algorithm to determine whether two context free grammars generate the same language. Which of the following is true?
Which of the following can generate Unrestricted grammars?
Which of the following statement(s) is/are CORRECT? I. Acids are sour in taste and generate H+ ions. II. Acids are sour in taste and generate OH– ions. III. Bases are bitter intaste and generate OH– ions.
A,B,C,D,E,G and I are seven friends who study in three different standards namely 5th, 6th and 7th such that not less than two friends study in the same standard. Each friend also has a different favorite subject namely History, Civics, English, Bangla, Science , Maths , and Economics but not necessarily in the same order. A likes Maths and studies in the 5th standard with only one other friend who likes Bangla. I studies with tow other friends . Both the friends who study with I like languages (Here languages include only Science , English and Bangla ) . D studies in the 6th standard with only one person and does not like Civics . E studies with only one friend . The one who likes history does not study in 5th or 6th standard . E does not like languages. C does not like English , Science or Civics. Which combination represents E's favorite subject and the standard in which he studies?
The Indian People's Theatre Association (IPTA) has also worked on other Indian regional languages. These languages do not include which of the following languages?
If L1 and L2 are regular languages is/are also regular language(s).
All the regular languages can have one or more of the following descriptions: i) DFA ii) NFA iii) e-NFA iv) Regular Expressions Which of the following are correct?
Grammars that can be translated to DFAs is ___________
In Right-Linear grammars, all productions have the form: A → xB.
Grammars that can be translated to DFAs is __________