Forgot Password?
Mobile number is now mandatory for the security of your account.
We've sent you a verification code on your mobile number. Please enter it here to set a new password.
We've sent you a verification code on your mobile number or email address. Please enter it here to set a new password.
Write the LMD, RMD and parse tree for the string '+ xyxy' using the grammar
Write short note on:
Chomsky hierarchy
Applications of context-free languages
Post's correspondence problem
Multitape turing machine
Design a turing machine for the language L =. Write the transition diagram for the same and also, indicate the moves made by the turing machine for the input 'aabb'.
Define a turing machine and explain the working of a basic turing machine with a neat diagram.
Prove that the family of context-free languages is closed under union, concatenation and star-closure
Define CNF and convert the following grammar into CNP.
Eliminate the useless symbols and productions from the following grammar.
Convert the following CFG to an equivalent PDA:
Design a PDA for the language Draw the transition diagram and also write the sequence od ID's for the string 'abba'.
Define a PDA and explain the working of it with a neat diagram
What is an ambiguous grammar? Show that the following grammar is ambiguous:
Define the following with examples:
i) Alphabet,
Define CFG. Design CFG's for the following languages:
ii) L=
i) L =
Minimize the following DFA using table filling algorithm.
Show that the language L = is not regular.
State and prove pumping lemma for regular languages.
Write the NFA for the regular expression ab(a + b)*.
Prove that every language defined by a regular expression is also defined by a finite automation
Define a regular expression. Also write the regular expressions for the following languages.
ii) L =
i) The set of all strings ending in the substring '00' on = (0,1)
Convert the following NFA to its equivalent DFA.
Define DFA. Write the DFA's for the following languages on
ii)
i) The set of all strings containing the substring 'ab'.
ii) String.
Congratulations! Your trial of
is now active.
Let's catch up on a Zoom call and I'll help you craft a killer career plan! Bring your own coffee.
Sourabh Bajaj
xyxy' using the grammar
. Write the transition diagram for the same and also, indicate the moves made by the turing machine for the input 'aabb'. 
Draw the transition diagram and also write the sequence od ID's for the string 'abba'. 
is not regular.
NFA for the regular expression ab(a + b)*.
= (0,1)
