Automata Theory and Formal Language
Showing 226-246 of 246 answers
What is an undecidable problem?
- When a TM cannot make a decision on an instance of the problem Correct
- When a CFG cannot make a decision on an instance of the problem
- When a PDA cannot make a decision on an instance of the problem
- When a RE cannot make a decision on an instance of the problem
What is an ε-NFA?
- It is a DFA where all transitions are ε-transitions
- It is an NFA where all transitions are ε-transitions
- It is a DFA with at least one explicit ε-transition defined
- It is an NFA with at least one explicit ε-transition defined Correct
What is automata theory?
- To answer the fundamental questions in computer science
- All of the choices Correct
- To find out if a problem is computable
- Study of abstract computing devices or machines
What is the final result after converting the following NFA-ε to NFA without Null move.
- What is the final result after converting the following NFA-ε to NFA without Null move. Correct
What kind of languages does a TM decide?
- regular expression
- context-sensitive
- recursively enumerable Correct
- context-free
Which among the following cannot be accepted by a regular grammar?
- L is a set of 0n1n Correct
Which among the following is not a part of the Context free grammar tuple?
- End SymbolCorre Correct
Which among the following is the correct option for the given grammar? G->X111|G1,X->X0|00.
- {0a1b|a=2,b=3} Correct
Which among the following is the option for the given grammar? G->X111|G1,X->X0|00
- {0a1b|a=2,b=3} Correct
Which of the following is a not a part of 5-tuple finite automata?
- Output Alphabet Correct
Which of the following Set Operations produces the set that contains everything that is in Set A and in Set B?
- Complement
- Union Correct
- Intersection
- Set Difference
Which of the following statement is false in context of tree terminology?
- Root with no children is called a leaf Correct
Which of the following statements are correct for a concept called inherent ambiguity in CFL?
- Every CFG for L is ambiguous Correct
Which of the following statements are for a concept called inherent ambiguity in CFL?
- Every CFG for L is ambiguous Correct
Which of the following statements is true about NPDA, DPDA, and RL?
- RL • DPDA • NPDA
- RL* • DPDA* • NPDA*
- RL ⊃ DPDA ⊃ NPDA
- RL ⊂ DPDA ⊂ NPDA Correct
Which of the following ways can be done to simplify a CFG?
- Eliminate symbols that are not useful
- Eliminate the ε symbol
- Eliminate productions of the form A → B Correct
- Eliminate productions of the form A → b
Which of the following will not be accepted by the following DFA?
- ababaabaa Correct
Which one is the answer?
- Computer Correct
Who is the father of modern computer science?
- Noam Chomsky
- Alan Turing Correct
- Steve Jobs
- Bill Gates
Who is the father of modern computer?
- Charles Babbage Correct
Z2 uses electricity to convey letters and transmit information quickly in 1844.
- TRUE Correct
This course is taught by the mentor:
Master of Science in Computer Science.
All courses