Start Discovering Solved Questions and Your Course Assignments
TextBooks Included
Active Tutors
Asked Questions
Answered Questions
Describe in detail about 2-way infinite tape TM. What do you understand by a multi-tape Turing machine?
What are the closure properties of CFL? Define the pumping lemma for CFLs.
What do you mean by ambiguous grammar? What do you mean by Pushdown Automata?
Transform RE to NFA, convert to DFA and find Minimized DFA.
Write down the applications of pumping lemma? And define the theorem.
What do you mean by Transition Diagram? Write down the properties of Transition Function(δ)
What do you mean by back patching? Write down the applications of DAG.
Create Predictive Parsing table for the grammar given below: S -> (L) / a L -> L, S/S
Write down the disadvantages of operator precedence parsing?
Distinguish between Existential and Universal Quantifiers. Describe the terms fact, consequence and valid argument in propositional Logic.
Describe Fuzzy logic neural networks. Compare Logic Programming with PROLOG'.
Translate the following English sentences into predicate Logic: Everyone is loyal to someone. All Romans were either Loyal to Caesar or hated him.
Convert the following regular expression into NFA using Thompson’s construction.
A function returns a number, takes no arguments, and its body is a block. Functions are defined exactly like variables in the grammar except that function name is follow by a block. Show the grammar
If not, rewrite the grammar until it is LL(1), proven. If you cannot accomplish this, why? Either way, show the appropriate sets leading to your decision.
Define the terms multigraph and simple graph. Differentiate between them with the help of example.
Construct the DFA (Deterministic Finite Automata) accepting following Set: {w ∈ {a,b}*: w has the even number of a’s and odd number of b’s}. Construct Turing Machine for the following
Define the following concepts formally:Finite Automata, Non-Deterministic Finite Automata (NDFA), Kleene Closure of a set of expressions,Turing Machine and NP-Hard Problem.
Let ∑ = {0,1}. Define the following language:L = {x | x contains an equal number of occurrences of 01 and 10}Either prove L is regular (by constructing a DFA/NFA or a regex) or prove that
A non-empty string β is called a repeat prefix of a string s if ββ is a prefix of s. Give a linear time algorithm to find the longest repeat prefix of s.
Let ∑ ={f0,1}, and let A be the language {abwba| a,b Ε ∑ , w Ε ∑*}. Construct a DFA that accepts precisely strings in A.Convert the following NFA into an equivalent D
(CFG to PDA) Design a PDA for the above grammar using a transition diagram and specifying the start/accept state(s), start symbol on the stack
Give a simple description of the language generated by the grammar with productions:
Show that the vector x which is indexed by the edges E and for which xe= 1/5 for all e in E is in the Perfect Matching Polytope PPM
Which of the following statements summarizes the properties of a hard-core predicate P for a one-way function.