The Gateway to Computer Science Excellence
For all GATE CSE Questions
Toggle navigation
Facebook Login
or
Email or Username
Password
Remember
Login
Register

I forgot my password
Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Prev
Blogs
New Blog
Exams
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.
asked
Jan 1, 2019
in
Theory of Computation
by
sripo
Active
(
2.5k
points)

124
views
regularexpressions
theoryofcomputation
finiteautomata
regularlanguages
expression
madeeasytestseries
0
votes
1
answer
2
Automata for given Regular Expression
Can you please draw the DFA for given regex (ab*)*
asked
Oct 10, 2018
in
Theory of Computation
by
sripo
Active
(
2.5k
points)

140
views
theoryofcomputation
regularexpressions
finiteautomata
regularlanguages
expression
+2
votes
4
answers
3
Automata to Regular Expression
Ans. C
asked
Sep 2, 2018
in
Theory of Computation
by
Na462
Loyal
(
7k
points)

135
views
finiteautomata
regularexpressions
theoryofcomputation
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/gate200852 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...
asked
Dec 2, 2017
in
Theory of Computation
by
Namit Dhupar
Active
(
1.5k
points)

227
views
finiteautomata
theoryofcomputation
expression
regularexpressions
0
votes
0
answers
5
context free grammer
asked
Sep 4, 2017
in
Theory of Computation
by
Sunil8860
(
113
points)

39
views
regular
expression
+3
votes
2
answers
6
regular expression
asked
Sep 4, 2017
in
Theory of Computation
by
Sunil8860
(
113
points)

106
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;$
asked
Sep 24, 2016
in
DS
by
Vishal Goyal
Active
(
1.8k
points)

247
views
datastructures
timecomplexity
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
asked
Jul 8, 2016
in
Theory of Computation
by
Kapil
Veteran
(
50.9k
points)

452
views
regularexpressions
finiteautomata
regular
expression
theoryofcomputation
+3
votes
2
answers
9
ISRO200928
The infix expression $A+(BC)^*D$ is correctly represented in prefix notation as $A+BC^*D$ $+A^*BCD$ $ABCD^*+$ $A+BCD^*$
asked
Jun 14, 2016
in
Compiler Design
by
jothee
Veteran
(
105k
points)

1.4k
views
isro2009
expression
+1
vote
2
answers
10
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
asked
Jun 8, 2016
in
Theory of Computation
by
shekhar chauhan
Boss
(
45.4k
points)

346
views
theoryofcomputation
finiteautomata
regular
expression
0
votes
3
answers
11
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 Superset 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 .
asked
Jun 6, 2016
in
Theory of Computation
by
shekhar chauhan
Boss
(
45.4k
points)

309
views
finiteautomata
theoryofcomputation
expression
regular
regularlanguages
+2
votes
1
answer
12
UGCNETDec2015III26
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)*
asked
Jun 5, 2016
in
Compiler Design
by
shekhar chauhan
Boss
(
45.4k
points)

896
views
theoryofcomputation
regularexpressions
finiteautomata
expression
ugcnetdec2015iii
+1
vote
1
answer
13
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 ".
asked
May 31, 2016
by
gate_forum
Junior
(
867
points)

865
views
regular
expression
+1
vote
1
answer
14
regular expression algebra
prove the identity: (a*ab + ba)* a* = (a + ab + ba)*
asked
May 29, 2016
in
Theory of Computation
by
gate_forum
Junior
(
867
points)

983
views
regular
expression
To see more, click for the
full list of questions
or
popular tags
.
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
ISRO CSE 2020 PAPER ANALYSE
BARC OCES/DGFS 2020
ISI CMI PDF by GATE Overflow
Calculus Important Points
Management Trainee Recruitment COAL INDIA 2020
Follow @csegate
Recent questions tagged expression
Recent Blog Comments
In the question associated with the register of a...
@Dumbest Kid They call in 1:8 ratio, in 2018 212...
For how many questions I can raise an objection?
https://www.isro.gov.in/sites/default/files/comput...
Can someone please post official answer key link
50,737
questions
57,306
answers
198,316
comments
105,012
users