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
Filter
User HenryAsks21
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by HenryAsks21
0
answers
1
Self doubt about CFG to CNF conversion.
I am still having some doubts when it comes to Context-Free Grammar to Chomsky Normal Form conversion. Here is what I did for the following CFG: $S \rightarrow bXb \ |\ bS \ |\ \epsilon\ |\ aSdSc$ $X \rightarrow aX \ |\ Xtt$ ... $H \rightarrow b$ $A \rightarrow a$ $D \rightarrow d$ $C \rightarrow c$ Did I do this correctly?
asked
in
Theory of Computation
May 2, 2022
363
views
theory-of-computation
conjunctive-normal-form
0
answers
2
Self Doubt about Construction of CFG
I am trying to construct a CFG for this following langauge: L = $\{0^i 1^j | i \neq j \ and \ i, j > 0\}$, this is what I came up with: $ S \rightarrow A \ | \ B $ $A \rightarrow 0A1 \ |\ A1 \ |\ 011$ ... strings that we can have: s = {011, 00111, 001, 00011, ...} and it worked. So, my question is, is this correct CFG for this particular L?
commented
in
Theory of Computation
May 1, 2022
317
views
theory-of-computation
context-free-language
0
answers
3
How to tackle regular expression to e-NFA conversion with multiple Kleene stars?
I need to clear up some doubts when it comes to applying Kleene closure (star) when converting re to e-NFA. I constructed the following regular expression: $(a+(a+b)^∗)^∗$, but what is bothering me is ... graph correct for my regular expression or do I need to e-transition again from the old final states to the new?
comment edited
in
Theory of Computation
Apr 7, 2022
435
views
theory-of-computation
0
answers
4
Convert the following regular expressions to NFA.
Convert the following regular expression (0+11)0*1 to NFA with e-transitions using the procedure given on pg. 66-67 Theorem 1.54 (Lemma 1.55) of the Introduction to Theory of Computation 3rd edition book by Michael Sipser. I followed ... Kleene star is added individually like 0*, how would we illustrate this? This was my approach for just 0*1 part:
comment edited
in
Theory of Computation
Apr 7, 2022
1.1k
views
theory-of-computation
3
answers
5
For any language, if the union of both is regular, then are those languages regular languages as well?
answer selected
in
Theory of Computation
Mar 4, 2022
1.4k
views
finite-automata
Subscribe to GATE CSE 2024 Test Series
Subscribe to GO Classes for GATE CSE 2024
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
Post GATE 2024 Guidance [Counseling tips and resources]
GATE CSE 2024 Result Responses
[Project Contest] Pytorch backend support for MLCommons Cpp Inference implementation
Participating in MLCommons Inference v4.0 submission (deadline is February 23 12pm IST)
IIITH PGEE 2024 Test Series by GO Classes
Subjects
All categories
General Aptitude
(3.5k)
Engineering Mathematics
(10.4k)
Digital Logic
(3.6k)
Programming and DS
(6.2k)
Algorithms
(4.8k)
Theory of Computation
(6.9k)
Compiler Design
(2.5k)
Operating System
(5.2k)
Databases
(4.8k)
CO and Architecture
(4.0k)
Computer Networks
(4.9k)
Artificial Intelligence
(79)
Machine Learning
(48)
Data Mining and Warehousing
(25)
Non GATE
(1.4k)
Others
(2.7k)
Admissions
(684)
Exam Queries
(1.6k)
Tier 1 Placement Questions
(17)
Job Queries
(80)
Projects
(11)
Unknown Category
(870)
64.3k
questions
77.9k
answers
244k
comments
80.0k
users
Recent Blog Comments
category ?
Hi @Arjun sir, I have obtained a score of 591 in ...
download here
Can you please tell about IIT-H mtech CSE self...
Please add your admission queries here:...