FAs is an FA that accepts all the string of FA1 andFA2. Union of two True False

Question

FAs is an FA that accepts all the string of FA1 andFA2.    Union of two
   True
   False
2:
A production of the form non-terminal   string of twonon-terminal is called a live
Production.                                                                                    
True
False
3:
DFA and PDA are equal in power.  
True
    False
4:
Syntax tree or Generation tree or Derivation tree are same tree
true
false
5;
PDA is only used to represent a regularlanguage.      

True
False
6:
PDA is stronger thanFA.                                                                         
True
False
7:
Two FAs are equivalent if they have same no. of states.
ture
false
8:
There exist exactly two different derivations in an ambiguous CFGfor a word.
true
false
    

Explanation / Answer

x.j5n FA that accepts all the string of FA1 and FA2.    Union of two    True    False 2: A production of the form non-terminal   string of two non-terminal is called a live Production.                                                                                      True False 3: DFA and PDA are equal in power.    True     False 4: Syntax tree or Generation tree or Derivation tree are same tree true false 5; PDA is only used to represent a regular language.           True False 6: PDA is stronger than FA.                                                                           True False

Related Questions

Navigate

• Browse (All)
• Browse F
• Subjects

---

---

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