Timeline for Regular expression for set of strings with no two consecutive 1's? [duplicate]
Current License: CC BY-SA 4.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 21, 2019 at 6:45 | comment | added | ComFreek | @RobertAndrews From the right operand of the outer $\cup$ you take $\varepsilon 1$, then from the left opreand of the outer $\cup$ you take $10$, which results in $110$. | |
| Oct 20, 2019 at 18:30 | history | duplicates list edited | D.W.♦ | duplicates list edited from How do I find a regular expression for a particular language? to How do I find a regular expression for a particular language?, Proving following regular expressions equal to one another? | |
| Oct 20, 2019 at 18:30 | history | closed | D.W.♦ | Duplicate of How do I find a regular expression for a particular language? | |
| Oct 20, 2019 at 17:41 | comment | added | Robert Andrews | @ComFreek I must be missing something, how does the first interpretation match 110? It seems like a correct regular expression for this language. | |
| Oct 20, 2019 at 17:20 | comment | added | Katie Rose | Yes that's how its parsed, hmmm, So I know ( (1 U (10))* U (1 U (10))* 0 ) is the case for all strings with no two consecutive 0's so I thought i'd just do the opposite for the answer. Is that not the case. | |
| Oct 20, 2019 at 15:24 | comment | added | ComFreek | How is this parsed? If it's (0 U (10))* U ( (0 U (10))* 1 ), then it's incorrect as $110$ is matched. If it's ( (0 U (10))* U (0 U (10))* ) 1, then it's incorrect as $0$ is not matched. So in either case, it's unfortunately wrong. | |
| Oct 20, 2019 at 14:38 | history | asked | Katie Rose | CC BY-SA 4.0 |