edited by
664 views
0 votes
0 votes

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

edited by

Please log in or register to answer this question.

Related questions

529
views
0 answers
0 votes
aditi19 asked Mar 17, 2019
529 views
Let A be a regular set. Consider the two sets belowL1={x | $\exists n\geq 0, \exists y\epsilon A :$ y=$x^n$}L2={x | $\exists n\geq 0, \exists y\epsilon A :$ x=$y^n$}which...
281
views
1 answers
0 votes
targate2018 asked Dec 5, 2017
281 views
Which of the following strings will match the linux regex a?b*?1. (empty string)2. b,bb,bbb.... and ab,abb,abbb......3. both a and b4. acbd, acbde and acbdef
671
views
3 answers
3 votes
GO Classes asked Feb 5
671 views
Which of the following strings are a member of the language described by the regular expression $\left(a^* {b} {a}^* b a^* b {a}^*\right)^*$$b b b b$$bbaaabb$$bbaaabbbabb...
416
views
3 answers
4 votes
GO Classes asked Jan 13
416 views
Below you see the transition table of a finite state automaton. The initial state is $0;$ the final state is $4.$ $\emptyset$ denotes the fail state, where no successful ...