search
Log In

Recent questions tagged expression

0 votes
1 answer
4
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...
asked Dec 2, 2017 in Theory of Computation Namit Dhupar 349 views
0 votes
0 answers
5
3 votes
2 answers
6
3 votes
3 answers
7
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 Vishal Goyal 311 views
2 votes
2 answers
8
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 Kapil 685 views
3 votes
2 answers
9
The infix expression $A+(B-C)^*D$ is correctly represented in prefix notation as $A+B-C^*D$ $+A^*-BCD$ $ABC-D^*+$ $A+BC-D^*$
asked Jun 14, 2016 in Compiler Design jothee 1.8k views
1 vote
2 answers
10
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 shekhar chauhan 569 views
0 votes
3 answers
11
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 .
asked Jun 6, 2016 in Theory of Computation shekhar chauhan 492 views
2 votes
1 answer
12
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 shekhar chauhan 1.7k views
1 vote
1 answer
13
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 in Unknown Category gate_forum 1.6k views
1 vote
1 answer
14
prove the identity: (a*ab + ba)* a* = (a + ab + ba)*
asked May 29, 2016 in Theory of Computation gate_forum 1.4k views
To see more, click for the full list of questions or popular tags.
...