Email: bbcnoun@gmail.com
Whatsapp/Telegram/Signalapp: 08131667008


CIT342

Question: A Turing machine that is able to stimulate other Turing machines is
Answer:  UTM

Question: A complete formal system is a formal system	.
Answer:  where all the true theorems can be proved.

Question: An inconsistent formal system is a formal system	.
Answer:  where at least one false statement can be proved.

Question: Turing machine is characterised by	tuples.
Answer:  7

Question: If a language L is recursive, it is closed under the following operations:
Answer: all of the options

Question: Which of the following machines is aTM?
Answer:  all of the options



Question: Which of the following can accept even palindrome over {a,b}?
Answer:  NDFA

Question: Which of the following problems are unsolvable?
Answer:  Halting problem

Question: A more recent generalization of top-down parsing language (TDPL) designed around the need of programming language is	
Answer:  Parsing Expression Grammar (PEG)

Question: Decision problems are stated on
where the answer is
Answer:  questions,binary


Question: A grammar is ambiguous, if it is
possible to generate	syntax
trees for an expression.
Answer:  two different

Question: Which of the following statements are true? Statement 1 : Initial state of NFA is initial state of DFA. Statement 2 : The final state of DFA will be every combination of final state of NFA.
Answer:  statement 1 is true and statement 2 is true






Email: bbcnoun@gmail.com
Whatsapp/Telegram/Signalapp: 08131667008