Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
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.
Can anyone explain how S2 is false,I did not understand their logic.
sripo
660
views
sripo
asked
Jan 1, 2019
Theory of Computation
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*)*
Can you please draw the DFA for given regex (ab*)*
sripo
681
views
sripo
asked
Oct 10, 2018
Theory of Computation
theory-of-computation
regular-expression
finite-automata
regular-language
expression
+
–
2
votes
4
answers
3
Automata to Regular Expression
Ans. C
Ans. C
Na462
772
views
Na462
asked
Sep 2, 2018
Theory of Computation
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 ... is too lengthy for exam point of view, so explanation with some other technique like state elimination will be appreciated...
Can someone please explain me how could we derive the RE from FA's ... Here https://gateoverflow.in/464/gate2008-52PS- Obviously the answer can be easily obtained using ...
Namit Dhupar
723
views
Namit Dhupar
asked
Dec 2, 2017
Theory of Computation
finite-automata
theory-of-computation
expression
regular-expression
+
–
0
votes
0
answers
5
context free grammer
Sunil8860
239
views
Sunil8860
asked
Sep 4, 2017
Theory of Computation
regular
expression
+
–
3
votes
2
answers
6
regular expression
Sunil8860
820
views
Sunil8860
asked
Sep 4, 2017
Theory of Computation
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;$
Find the time complexity of the following snippets1.for$\left ( i=1;i\leqslant n;i++ \right )$ for$\left ( j=n/3;j\leqslant 2n;j=j+n/3 \right )$ $x=x...
Vishal Goyal
832
views
Vishal Goyal
asked
Sep 24, 2016
DS
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
The equality of two regular expression is computed in? Give reasons also..Constant Timepolynomial timelogarithmic Polynomial timeExponential time
Kapil
1.4k
views
Kapil
asked
Jul 8, 2016
Theory of Computation
regular-expression
finite-automata
regular
expression
theory-of-computation
+
–
1
votes
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
If r1 and r2 are 2 Regular Expression Such thatr1 = (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
1.8k
views
shekhar chauhan
asked
Jun 8, 2016
Theory of Computation
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 .
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 alway...
shekhar chauhan
1.4k
views
shekhar chauhan
asked
Jun 6, 2016
Theory of Computation
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)^*$
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 expressio...
shekhar chauhan
3.2k
views
shekhar chauhan
asked
Jun 5, 2016
Theory of Computation
theory-of-computation
regular-expression
finite-automata
expression
ugcnetcse-dec2015-paper3
+
–
1
votes
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 ".
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
6.0k
views
gate_forum
asked
May 31, 2016
Unknown Category
regular
expression
+
–
1
votes
1
answer
13
regular expression algebra
prove the identity: (a*ab + ba)* a* = (a + ab + ba)*
prove the identity: (a*ab + ba)* a* = (a + ab + ba)*
gate_forum
2.3k
views
gate_forum
asked
May 29, 2016
Theory of Computation
regular
expression
+
–
To see more, click for the
full list of questions
or
popular tags
.
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register
