Other Questions

 Child Development and Pedagogy  Environmental Studies  C  C++  C#  Java  Chemistry  Physics  Electrical Engineering  Banking Awareness  Networking  Structured Query Language (SQL)  Computer Fundamentals  Logical Reasoning  Verbal Reasoning  Non Verbal Reasoning  General English  General Knowledge  Arithmetic Aptitude

Practice Paper sets

 SSC CGL  IBPS Bank PO  IBPS Bank Clerk  more

Syntax Analysis on Compiler related Questions and Answers


Question :   A language is regular if and only if it is accepted by finite automata
1. The given statement statement is true
2. Given statement is false
3. Statement is partially true
4. None of the mentioned
Answer :   1 - The given statement statement is true  

* Be the First to Post a Comment.

Submit comment :

Captcha Image
Reload

Ask Question

Captcha Image
Reload

Note : Name and Email never shown.





Subscribe


Become a part of EducationForever. Subscribe to our FREE Newsletter