Timeline for How to tell if the language of one regular expression exsit as subtrings in the language of another regular expression (behavior aspect)?
Current License: CC BY-SA 4.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 4 at 22:13 | comment | added | D.W.♦ | It's still not entirely clear to me what "are all substrings of strings" means. Do you mean, for every string $x \in L_1$, there exists $y \in L_2$ such that $x$ is a substring of $y$? Also I don't know how to interpret the "same start point" or "behavior aspect" stuff. Perhaps you mean to check whether there exists a string $s$ such that for every $x \in L_1$, there exists some $y \in L_2$ and some string $t$ such that $y=sxt$? The first step is to figure out how to precisely articulate the problem statement that you are trying to solve. | |
| Oct 4 at 20:01 | history | edited | Jin | CC BY-SA 4.0 |
edited title
|
| Oct 4 at 20:00 | history | edited | Jin | CC BY-SA 4.0 |
make question clear
|
| S Sep 17 at 15:39 | review | First questions | |||
| Oct 1 at 15:41 | |||||
| S Sep 17 at 15:39 | history | asked | Jin | CC BY-SA 4.0 |