The language L = {anbnan n? 1} is recognized by
A) turing machine
B) 2 pushdown automata
C) post machine
D) all are correct
Correct Answer:
Verified
Q2: How many states are present in the
Q3: Consider the state table of a finite
Q4: The set that can be recognized by
Q5: What is the reason behind a Turing
Q6: A pushdown automata behaves like a Turing
Q8: If Turing machine accepts all the words
Q9: If a Turing machine halts for each
Q10: Universal Turing machine (UTM) influenced the concepts
Q11: The number of symbols necessary to simulate
Q12: A universal Turing machine is a
A)reprogrammable truing
Unlock this Answer For Free Now!
View this answer and more for free by performing one of the following actions
Scan the QR code to install the App and get 2 free unlocks
Unlock quizzes for free by uploading documents