Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Recent questions tagged sample
7
votes
4
answers
1
TOC SAMPLE PRACTICE
Determine the minimum height of parse tree in CNF for terminal string of length w, which is constructed by using CFG G (a) log2|w|+1 (b) log2|w| (c) log2|w|−1 (d) None of these
Determine the minimum height of parse tree in CNF for terminal string of length w, which is constructed by using CFG G(a) log2|w|+1 (b) log2|w|(c) log2|w|−1 (d) None of...
Pranav Madhani
3.4k
views
Pranav Madhani
asked
Nov 19, 2017
Theory of Computation
theory-of-computation
practice
sample
context-free-grammar
+
–
1
votes
2
answers
2
TOC SAMPLE PRACTICE
Consider the language defined by the regular expression (a | b) * b+. Which of the following regular expressions also define that language? (i) (a*b+) | (b*b+) (ii) (ab |bb)*b* (iii) (a | b | ba)*b+ (a) i only (b) i & ii only (c) iii ... Solution: Option (c) Need explanation why not all? we can obtain only b by taking (a | b) null it also applies to a option then why not a?
Consider the language defined by the regular expression (a | b) * b+.Which of the following regular expressions also define that language?(i) (a*b+) | (b*b+)(ii) (ab |bb)...
Pranav Madhani
2.2k
views
Pranav Madhani
asked
Nov 18, 2017
Theory of Computation
theory-of-computation
sample
context-free-grammar
practice
+
–
0
votes
1
answer
3
Sample Practice
Consider this grammar: S → SS | a How many derivation trees are possible for a4? (a) 3 (b) 4 (c) 5 (d) 6 how to generalize for any values if a^5 or a^7 is there any general formulae?
Consider this grammar:S → SS | aHow many derivation trees are possible for a4?(a) 3 (b) 4(c) 5 (d) 6 how to generalize for any values if a^5 or a^7 is there any general...
Pranav Madhani
833
views
Pranav Madhani
asked
Nov 17, 2017
Theory of Computation
context-free-grammar
sample
practice
theory-of-computation
+
–
0
votes
1
answer
4
Toc Gate 2018 sample practice
Consider 2 regular expression: i. ϕ* + a+ + b+ + (a + b)+ → r1 ii. ϕ+ + a* + b* + (a + b)* → r2 (a) L(r1) = L(r2) (b) L(r1) ⊆ L(r2) (c) L(r1) ⊇ L(r2) (d) None of above Solution: Option (a) how need explanation? wont answer be c?
Consider 2 regular expression:i. ϕ* + a+ + b+ + (a + b)+ → r1ii. ϕ+ + a* + b* + (a + b)* → r2(a) L(r1) = L(r2) (b) L(r1) ⊆ L(r2)(c) L(r1) ⊇ L(r2) (d) None of ab...
Pranav Madhani
1.0k
views
Pranav Madhani
asked
Nov 17, 2017
Theory of Computation
theory-of-computation
sample
gatecse-2018
practice
context-free-grammar
+
–
1
votes
2
answers
5
TOC Sample Practice
Choose the correct statement for the following regular expression over the symbols 0 & 1. 0(0+1)*0 + 1(0+1)*1 (a) To represent all strings over 0’s and 1’s (b) To represent all strings which start with 0’s and end with 1’s (c) To represent all strings which start and end with same symbol (d) To represent all strings that starts and ends with 1’s
Choose the correct statement for the following regular expression over the symbols 0 & 1.0(0+1)*0 + 1(0+1)*1(a) To represent all strings over 0’s and 1’s(b) To repres...
Pranav Madhani
3.2k
views
Pranav Madhani
asked
Nov 16, 2017
Theory of Computation
sample
theory-of-computation
identify-class-language
+
–
To see more, click for the
full list of questions
or
popular tags
.
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register