Every NFA can be convertedto an FA ?True ? False In mealy machine outputcharacte

Question

Every NFA can be convertedto an FA
    
?True
   ? False

In mealy machine outputcharacter are mentioned on the transition.
    
?True
   ? False
Formal languages are called Semantic languages.
?True
   ? False

If a language can be accepted by FA then it can be accepted by a TGas well.
?True
   ? False

Question No: 12    ( Marks: 1)     - Please choose one

Length of output string is 1 less then that of input string ismealy machine.
?True
   ? False

Palindrome is a regular language.
?True
   ? False


Question No: 9    ( Marks: 1)     - Please choose one

If s = babab then palindrome of s = rev(s).  
    
?True
   ? False


Question No: 10    ( Marks: 1)     - Please choose one

TG must have only one start state.
    
?True
   ? False

Question No: 11    ( Marks
The language equal means number of a’s and b’s areequal with no null string.
?True
   ? False
NFA – null can be considered as TG and viseversa.  
?True
   ? False


Question No: 5    ( Marks: 1)     - Please choose one

? = {aA, b}, length(aAbaAaAb) = 5.
?True
   ? False


Question No: 6    ( Marks: 1)     - Please choose one

If s=abcd is a string defined over ? = {a,b,c,d} then reverse of sis dcba.
    
?True
   ? False
Length of a null string is supposed to be 1.
    
?True
   ? False


Question No: 2    ( Marks: 1)     - Please choose one

There is no difference between Word and String
    
?True
   ? False


Question No: 3    ( Marks: 1)     - Please choose one

There may be two RE representing the same language.
?True
   ? False

Explanation / Answer

Dear.., Every NFA can be converted to an FA. True, In mealy machine outputcharacter are mentioned on the transition.
True Formal languages are called Semantic languages.
FALSE If a language can be accepted by FA then it can be accepted bya TG as well TRUE Length of output string is 1 less then that of input string ismealy machine.
FALSE If s = babab then palindrome of s =rev(s).   
     
True


  


TG must have only one start state.
    
?True



The language equal means number of a’s and b’s areequal with no null string.  

   False
NFA – null can be considered as TG and viseversa.  
?True



Question No: 5    ( Marks: 1)     - Please choose one

? = {aA, b}, length(aAbaAaAb) = 5.  
True




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

   ? False ANS:dbca
Length of a null string is supposed to be 1.  
     

   ? False

  


There is no difference between Word and String
    
?True


There may be two RE representing the same language.
?True
If s = babab then palindrome of s =rev(s).   
     
True


  


TG must have only one start state.
    
?True



The language equal means number of a’s and b’s areequal with no null string.  

   False
NFA – null can be considered as TG and viseversa.  
?True



Question No: 5    ( Marks: 1)     - Please choose one

? = {aA, b}, length(aAbaAaAb) = 5.  
True




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

   ? False ANS:dbca
Length of a null string is supposed to be 1.  
     

   ? False

  


There is no difference between Word and String
    
?True


There may be two RE representing the same language.
?True
Palindrome is a regular language FALSE I Hope this will helps you. I Hope this will helps you.

Related Questions

Navigate

• Browse (All)
• Browse E
• Subjects

---

---

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