Login
Register
@
Dark Mode
Profile
Edit my Profile
Messages
My favorites
Register
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous Years
Blogs
New Blog
Exams
Dark Mode
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
Pranav Madhani
asked
in
Theory of Computation
Nov 19, 2017
by
Pranav Madhani
2.9k
views
theory-of-computation
practice
sample
context-free-grammar
1
vote
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?
Pranav Madhani
asked
in
Theory of Computation
Nov 19, 2017
by
Pranav Madhani
1.7k
views
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?
Pranav Madhani
asked
in
Theory of Computation
Nov 18, 2017
by
Pranav Madhani
621
views
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?
Pranav Madhani
asked
in
Theory of Computation
Nov 17, 2017
by
Pranav Madhani
763
views
theory-of-computation
sample
gatecse-2018
practice
context-free-grammar
1
vote
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
Pranav Madhani
asked
in
Theory of Computation
Nov 17, 2017
by
Pranav Madhani
3.0k
views
sample
theory-of-computation
identify-class-language
To see more, click for the
full list of questions
or
popular tags
.
Subscribe to GATE CSE 2023 Test Series
Subscribe to GO Classes for GATE CSE 2023
Quick search syntax
tags
tag:apple
author
user:martin
title
title:apple
content
content:apple
exclude
-tag:apple
force match
+apple
views
views:100
score
score:10
answers
answers:2
is accepted
isaccepted:true
is closed
isclosed:true
Recent Posts
DRDO Previous Year Papers
From Rank 4200 to 64: My Journey to Success in GATE CSE Exam
What are the key things to focus on during the final 10-15 days before the GATE exam to improve performance?
All India GO Classes Mock test
NTA UGC NET JRF December 2022 Apply Online Form 2023
Subjects
All categories
General Aptitude
(2.5k)
Engineering Mathematics
(9.3k)
Digital Logic
(3.3k)
Programming and DS
(5.8k)
Algorithms
(4.6k)
Theory of Computation
(6.7k)
Compiler Design
(2.3k)
Operating System
(5.0k)
Databases
(4.6k)
CO and Architecture
(3.8k)
Computer Networks
(4.6k)
Non GATE
(1.3k)
Others
(2.4k)
Admissions
(649)
Exam Queries
(842)
Tier 1 Placement Questions
(17)
Job Queries
(74)
Projects
(9)
Unknown Category
(853)
Recent questions tagged sample
Recent Blog Comments
It's not a standard resource, don't follow them.
https://byjus.com/maths/diagonalization/
@amit166 can you share the reference of the...
Twist at every point Man
Diagonalization of a MatrixIf there is an...