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 expression
0
votes
1
answer
1
MadeEasy Subject Test 2019: Theory Of Computation - Regular Languages
Can anyone explain how S2 is false,I did not understand their logic.
sripo
asked
in
Theory of Computation
Jan 1, 2019
by
sripo
615
views
regular-expression
theory-of-computation
finite-automata
regular-language
expression
made-easy-test-series
0
votes
1
answer
2
Automata for given Regular Expression
Can you please draw the DFA for given regex (ab*)*
sripo
asked
in
Theory of Computation
Oct 10, 2018
by
sripo
650
views
theory-of-computation
regular-expression
finite-automata
regular-language
expression
2
votes
4
answers
3
Automata to Regular Expression
Ans. C
Na462
asked
in
Theory of Computation
Sep 2, 2018
by
Na462
716
views
finite-automata
regular-expression
theory-of-computation
expression
0
votes
1
answer
4
Regular Expression from Finite Automata
Can someone please explain me how could we derive the RE from FA's ... Here-- https://gateoverflow.in/464/gate2008-52 PS- Obviously the answer can be easily obtained using parsing, but how can we derive the regular expression?? Ardent is too lengthy for exam point of view, so explanation with some other technique like state elimination will be appreciated...
Namit Dhupar
asked
in
Theory of Computation
Dec 2, 2017
by
Namit Dhupar
692
views
finite-automata
theory-of-computation
expression
regular-expression
0
votes
0
answers
5
context free grammer
Sunil8860
asked
in
Theory of Computation
Sep 4, 2017
by
Sunil8860
213
views
regular
expression
3
votes
2
answers
6
regular expression
Sunil8860
asked
in
Theory of Computation
Sep 4, 2017
by
Sunil8860
772
views
regular
expression
3
votes
3
answers
7
time complexity
Find the time complexity of the following snippets 1. for$\left ( i=1;i\leqslant n;i++ \right )$ for$\left ( j=n/3;j\leqslant 2n;j=j+n/3 \right )$ $x=x+1;$ 2. for$\left ( i=1;i\leqslant n;i++ \right )$ for$\left ( j=1;j\leqslant n;j=j+i \right )$ $x=x+1;$
Vishal Goyal
asked
in
DS
Sep 24, 2016
by
Vishal Goyal
779
views
data-structures
time-complexity
algorithms
expression
2
votes
2
answers
8
Regular Expression time complexity
The equality of two regular expression is computed in? Give reasons also.. Constant Time polynomial time logarithmic Polynomial time Exponential time
Kapil
asked
in
Theory of Computation
Jul 8, 2016
by
Kapil
1.3k
views
regular-expression
finite-automata
regular
expression
theory-of-computation
1
vote
2
answers
9
Automata Regular expression
If r1 and r2 are 2 Regular Expression Such that r1 = (a+b)* r2 = (a*+b*+a*b*+b*a*) What are the different case's in which r1 = r2 ? Please Explain with an example
shekhar chauhan
asked
in
Theory of Computation
Jun 8, 2016
by
shekhar chauhan
1.7k
views
theory-of-computation
finite-automata
regular
expression
0
votes
3
answers
10
Finite Automata Regular Expression
Problem 1 : what is the Language associated with this regular expression ? a*b* write it down. Problem 2: Does either a subset or Super-set of a regular language is always a regular ? Problem 3 : What is the difference between a^n b^n and a*b* Explain with a example .
shekhar chauhan
asked
in
Theory of Computation
Jun 6, 2016
by
shekhar chauhan
1.3k
views
finite-automata
theory-of-computation
expression
regular
regular-language
2
votes
1
answer
11
UGC NET CSE | December 2015 | Part 3 | Question: 26
The context free grammar given by $S \rightarrow XYX$ $X \rightarrow aX \mid bX \mid \lambda$ $Y \rightarrow bbb$ generates the language which is defined by regular expression: $(a+b)^*bbb$ $abbb(a+b)^*$ $(a+b)^*(bbb)(a+b)^*$ $(a+b)(bbb)(a+b)^*$
shekhar chauhan
asked
in
Theory of Computation
Jun 5, 2016
by
shekhar chauhan
3.2k
views
theory-of-computation
regular-expression
finite-automata
expression
ugcnetcse-dec2015-paper3
1
vote
1
answer
12
regular expression
regular expression for " set of all strings over {a,b} in which there are at least two occurrences of b between any two occurrences of a ".
gate_forum
asked
in
Unknown Category
May 31, 2016
by
gate_forum
5.9k
views
regular
expression
1
vote
1
answer
13
regular expression algebra
prove the identity: (a*ab + ba)* a* = (a + ab + ba)*
gate_forum
asked
in
Theory of Computation
May 29, 2016
by
gate_forum
2.2k
views
regular
expression
To see more, click for the
full list of questions
or
popular tags
.
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
(24)
Non GATE
(1.4k)
Others
(2.7k)
Admissions
(682)
Exam Queries
(1.6k)
Tier 1 Placement Questions
(17)
Job Queries
(80)
Projects
(11)
Unknown Category
(870)
64.3k
questions
77.9k
answers
243k
comments
79.6k
users
Recent questions tagged expression
Recent Blog Comments
Hlo I'm Rupesh I got AIR 3485 in gate CS and AIR...
@Ajay Sasank here is the direct link...
Thank you for the post didi My GATE 2023 & 2024...
I Hope it helps 😊
Today's best post I seen thank you for motivation