menu
search
Log In
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

Subjects

Recent questions tagged regular-expressions

Network Sites

 GO Mechanical
 GO Electrical
 GO Electronics
 GO Civil
 CSE Doubts

Recent questions tagged regular-expressions

0 votes
0 answers
2
To test if the given language is regular.
There are two sources on YouTube giving different answers for the same expression.I am confused. Is the given expressions wxwr | w,x $\in$(0,1)+ I think this is regular because this can be reduced to ending with 00 or 01 or 10 or 11 wwrx | w,x $\in$(0,1)+ I think this is regular because it can reduced to starting with 0 or 1
There are two sources on YouTube giving different answers for the same expression.I am confused. Is the given expressions wxwr | w,x $\in$(0,1)+ I think this is regular because this can be reduced to ending with 00 or 01 or 10 or 11 wwrx | w,x $\in$(0,1)+ I think this is regular because it can reduced to starting with 0 or 1
asked Oct 16, 2018 in Theory of Computation sripo 239 views
0 votes
0 answers
3
Can a^p where p is a prime number be an NFA?
Let l={ (ap )* | p is a prime number} and $\sum$={a}.The minimum number of states in NFA which can accept this language. This is a question from a test series,I just want to know if the question is valid as I feel raised to prime number will not be regular,correct me if I am wrong.Not asking for solution to the question but if the question is valid.
Let l={ (ap )* | p is a prime number} and $\sum$={a}.The minimum number of states in NFA which can accept this language. This is a question from a test series,I just want to know if the question is valid as I feel raised to prime number will not be regular,correct me if I am wrong.Not asking for solution to the question but if the question is valid.
asked Oct 16, 2018 in Theory of Computation sripo 1.2k views
0 votes
0 answers
4
Regular Languages
Which is the equivalent Regular Expression for the following: "Strings in which every group of 3 symbols should contain atleast 1 a." a)[(a+b) (a+b)a]* b) [(a+b) (a+b)a]* [(a+b)(a+b)a]* c)[(ϵ + b + bb)a]* [ ϵ+ b + bb] d) (abb)* (bab)b* (bba)*
Which is the equivalent Regular Expression for the following: "Strings in which every group of 3 symbols should contain atleast 1 a." a)[(a+b) (a+b)a]* b) [(a+b) (a+b)a]* [(a+b)(a+b)a]* c)[(ϵ + b + bb)a]* [ ϵ+ b + bb] d) (abb)* (bab)b* (bba)*
asked Oct 14, 2018 in Theory of Computation Sambhrant Maurya 139 views
0 votes
0 answers
6
Equivalence of regular expressions
For $\sum$={a,b} Re given is b*ab*(aa)*b* this is non minimized dfa but when the dfa is minimized we get RE as b*a(a+b)*. How to show that are they equivalent or is it just worked for this case?
For $\sum$={a,b} Re given is b*ab*(aa)*b* this is non minimized dfa but when the dfa is minimized we get RE as b*a(a+b)*. How to show that are they equivalent or is it just worked for this case?
asked Oct 10, 2018 in Theory of Computation sripo 268 views
1 vote
1 answer
7
regular exprression
what is the equivalent nfa for the given regular expression? a*b*(ba)*a*
what is the equivalent nfa for the given regular expression? a*b*(ba)*a*
asked Oct 9, 2018 in Theory of Computation suneetha 195 views
0 votes
0 answers
8
ullman chapter regular expressions and languages exercise 3.1
Not able to construct the regular expressions for the statements
Not able to construct the regular expressions for the statements
asked Oct 7, 2018 in Theory of Computation Rhythm 89 views
0 votes
2 answers
9
regular ex
difference between a*(ba)* and (a+ba)* and how to represent both in finite automata?
difference between a*(ba)* and (a+ba)* and how to represent both in finite automata?
asked Oct 6, 2018 in Theory of Computation suneetha 124 views
0 votes
2 answers
10
regular expressions
how can we represent (ab)*ba*(b+a)*aab* in finite automata?
how can we represent (ab)*ba*(b+a)*aab* in finite automata?
asked Oct 6, 2018 in Theory of Computation suneetha 128 views
0 votes
2 answers
13
Peter Linz Edition 4 Exercise 3.1 Question 18 (Page No. 76)
Find regular expressions for the following languages on {a, b}. (a) L = {w : |w| mod 3 = 0} (b) L = {w : na (w)mod 3 = 0} (c) L = {w : na (w)mod 5 > 0} Also Design DFA for the same.
Find regular expressions for the following languages on {a, b}. (a) L = {w : |w| mod 3 = 0} (b) L = {w : na (w)mod 3 = 0} (c) L = {w : na (w)mod 5 > 0} Also Design DFA for the same.
asked Sep 27, 2018 in Theory of Computation Karan Dodwani 1 442 views
1 vote
2 answers
14
TOC (Regular expression)
Given two Regular expressions are equal or not ? 1) (1+01*0)* 2) 1*(01*0)* 1* Give proper explanation also.
Given two Regular expressions are equal or not ? 1) (1+01*0)* 2) 1*(01*0)* 1* Give proper explanation also.
asked Sep 27, 2018 in Theory of Computation Ashish Roy 1 716 views
0 votes
0 answers
15
ISI2016-PCB-CS-6
Let L be a regular language over $\{0,1\}$. Define the reverse of the language $L$ to be the language $L^R = \{ w \in \{0,1\}^* \: \: : \: \: \text{ reverse }(w) \in L\}$, where $\text{reverse}(w)$ denotes the string $w$ ... $x$ contains an odd number of $1's$ and $00$ as a substring$\}.$ Construct a regular expression for the language $L$.
Let L be a regular language over $\{0,1\}$. Define the reverse of the language $L$ to be the language $L^R = \{ w \in \{0,1\}^* \: \: : \: \: \text{ reverse }(w) \in L\}$, where $\text{reverse}(w)$ denotes the string $w$ ... $x$ contains an odd number of $1's$ and $00$ as a substring$\}.$ Construct a regular expression for the language $L$.
asked Sep 18, 2018 in Theory of Computation jothee 98 views
1 vote
1 answer
16
Consider the following regular expression R=(a+b)* (a+b+ε)a
Consider the following regular expression R=(a+b)* (a+b+ε)a which of the following is equivalent to the above a)(a*+b*)+ (aa+ba) b)(ε+a+b*)+ a c)(a+b)+ (a+b+ε)a d)None of these
Consider the following regular expression R=(a+b)* (a+b+ε)a which of the following is equivalent to the above a)(a*+b*)+ (aa+ba) b)(ε+a+b*)+ a c)(a+b)+ (a+b+ε)a d)None of these
asked Sep 15, 2018 in Theory of Computation Kshitij Hansda 510 views
2 votes
2 answers
17
Regular Language
Is the given Grammer represent a regular language ? S->AaB A->aC | epsilon B->aB | bB | epsilon C->aCb | epsilon
Is the given Grammer represent a regular language ? S->AaB A->aC | epsilon B->aB | bB | epsilon C->aCb | epsilon
asked Sep 13, 2018 in Theory of Computation Na462 263 views
0 votes
1 answer
19
Doubt in regular expressions
Consider the regular expression R = a*b* + b*a*. The number of equivalence classes of Σ* to represent a language which is equivalent to R is ____________.
Consider the regular expression R = a*b* + b*a*. The number of equivalence classes of Σ* to represent a language which is equivalent to R is ____________.
asked Sep 12, 2018 in Theory of Computation goluabhinan 208 views
0 votes
1 answer
21
regular expression
can i get all the formulas of expression (a+b)*.
can i get all the formulas of expression (a+b)*.
asked Sep 9, 2018 in Theory of Computation Prathap Ñsvr 162 views
0 votes
0 answers
22
test series
Consider this regular expression: r = (a*b)* + (b*a)* This is equivalent to (a) (a + b)* (b) (a + b)* · (ab)+ + (a + b)* (ba)+ (c) (a + b)*a + (a + b)* b (d) None of above
Consider this regular expression: r = (a*b)* + (b*a)* This is equivalent to (a) (a + b)* (b) (a + b)* · (ab)+ + (a + b)* (ba)+ (c) (a + b)*a + (a + b)* b (d) None of above
asked Sep 3, 2018 in Theory of Computation navya n 199 views
0 votes
2 answers
26
TOC Finite Automata
How to construct a finite automata equivalent to the regular expression: ( 0 + 1 )* ( 00 + 11 ) ( 0 + 1 )*
How to construct a finite automata equivalent to the regular expression: ( 0 + 1 )* ( 00 + 11 ) ( 0 + 1 )*
asked Sep 1, 2018 in Theory of Computation iarnav 3.4k views
0 votes
1 answer
27
Theory of computation
Which of the following CFG’s can’t be simulated by an FSM ? a. S->Sa/b b. S->aSb/ab c. S->abX, X->cY, Y->d/aX d. None of these
Which of the following CFG’s can’t be simulated by an FSM ? a. S->Sa/b b. S->aSb/ab c. S->abX, X->cY, Y->d/aX d. None of these
asked Aug 31, 2018 in Theory of Computation Rackson 939 views
0 votes
1 answer
28
GATE 2014 Set 1 Q65
Which of the regular expressions given below represent the following DFA? A) 0*1(1+00*1)* B) 0*1*1+11*0*1 C) (0+1)*1
Which of the regular expressions given below represent the following DFA? A) 0*1(1+00*1)* B) 0*1*1+11*0*1 C) (0+1)*1
asked Aug 31, 2018 in Theory of Computation aditi19 538 views
0 votes
2 answers
29
Peter Linz-Doubt
Give regular expression for all strings not ending with '01' on Σ={0, 1}. is this expression correct? (ɛ+1*0*+(0+1)*1*0)*
Give regular expression for all strings not ending with '01' on Σ={0, 1}. is this expression correct? (ɛ+1*0*+(0+1)*1*0)*
asked Aug 30, 2018 in Theory of Computation aditi19 133 views
Page:
Dark theme
Muffin by Hélio Chun
Thanks to Q2A
...