The Gateway to Computer Science Excellence
For all GATE CSE Questions
Toggle navigation
GATE Overflow
Facebook Login
Google 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
First time here? Checkout the
FAQ
!
x
×
Close
Use the google search bar on side panel. It searches through all previous GATE/other questions. For hardcopy of previous year questions please see
here
Recent questions tagged expression
0
votes
1
answer
1
Automata for given Regular Expression
Can you please draw the DFA for given regex (ab*)*
asked
Oct 10
in
Theory of Computation
by
sripo
Junior
(
933
points)

69
views
theoryofcomputation
regularexpressions
finiteautomata
regularlanguages
expression
0
votes
2
answers
2
Automata to Regular Expression
Ans. C
asked
Sep 2
in
Theory of Computation
by
Na462
Loyal
(
7.4k
points)

68
views
finiteautomata
regularexpressions
theoryofcomputation
expression
0
votes
1
answer
3
Regular Expression Identities
${(a+aa+b)}^{+}={(a+b)}^{+}$
asked
Aug 20
in
Theory of Computation
by
Dhananjay15
(
83
points)

37
views
prove
the
expression
0
votes
4
answers
4
Gradeup question doubt
$x(x+x'y)z(x+y+z)$ simplifies to (A)$x+x'y$ (B)$x+y+z$ (C)$xyz$ (D)$xz$ Answer is (D) But I can not obtain $xz$ only. My solutions is as follows: x(x+x'y)z(x+y+z) =(x+y)(xz+yz+z) =xz+xyz+xz+xyz+yz+yz =xz+yz+xyz =xz(1+y)+yz =xz+yz Can anyone tell where I made mistake?
asked
May 25
in
Digital Logic
by
Dhoomketu
(
159
points)

66
views
digitallogic
logic
boolean
expression
0
votes
0
answers
5
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)

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

33
views
regular
expression
+2
votes
2
answers
7
regular expression
asked
Sep 4, 2017
in
Theory of Computation
by
Sunil8860
(
131
points)

72
views
regular
expression
+3
votes
3
answers
8
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.9k
points)

231
views
datastructure
timecomplexity
algorithms
expression
+2
votes
2
answers
9
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.5k
points)

377
views
regularexpressions
finiteautomata
regular
expression
theoryofcomputation
+3
votes
2
answers
10
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
(
112k
points)

1.2k
views
isro2009
expression
+1
vote
2
answers
11
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)

287
views
theoryofcomputation
finiteautomata
regular
expression
0
votes
3
answers
12
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)

286
views
finiteautomata
theoryofcomputation
expression
regular
regularlanguages
+2
votes
1
answer
13
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)

738
views
theoryofcomputation
regularexpressions
finiteautomata
expression
ugcnetdec2015iii
+1
vote
1
answer
14
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
Active
(
1.1k
points)

569
views
regular
expression
+1
vote
1
answer
15
regular expression algebra
prove the identity: (a*ab + ba)* a* = (a + ab + ba)*
asked
May 29, 2016
in
Theory of Computation
by
gate_forum
Active
(
1.1k
points)

897
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
IIT HYDERABAD M.Tech (RA) 3Years Winter Session Interview experience
INDIAN AIR FORCE
GATE BOOK _ TEST SERIES DOUBT_
Visualizing complex C code
GATE Book Test Series
Follow @csegate
Gatecse
Recent questions tagged expression
Recent Blog Comments
There is one more problem. Ppl who have...
CL013924707IN rt?
I ordered the GO BOOK 6 dec ....but still i didnt...
thankyou sir
44,251
questions
49,748
answers
164,059
comments
65,844
users