Theory of Computation(BCSE304L)
Looking for Theory of Computation(BCSE304L) test answers and solutions? Browse our comprehensive collection of verified answers for Theory of Computation(BCSE304L) at lms.vit.ac.in.
Get instant access to accurate answers and detailed explanations for your course questions. Our community-driven platform helps students succeed!
Which of the following is true for CYK Algorithm?
0%
0%
0%
0%
View this question
Which of the following is/are true about CYK algorithm? a) It requires that the grammar be in Chomsky Normal Form (CNF) b) Bottom up parsing c) It requires that the grammar be in Greibach Normal Form (GNF) d) Top Down Parsing
0%
0%
0%
100%
View this question
A DPDA is a PDA in which:
100%
0%
0%
0%
View this question
The following move of a PDA is on the basis of:
0%
0%
0%
100%
View this question
WW | W is {a,b}* is a regular language
100%
0%
View this question
In stack,elements can be removed
100%
0%
0%
0%
View this question
PDA may be determinstic or non-determinstic.
100%
0%
View this question
which of the follwing language is not regular
0%
0%
0%
100%
View this question
Finite state machines have limited memory only in the form of states.
100%
0%
View this question
In formal notation Z0 is stack bottom symbol
0%
100%
View this question
Want instant access to all verified answers on lms.vit.ac.in?
Get Unlimited Answers To Exam Questions - Install Crowdly Extension Now!