Timeline for Proving that L(G) is the language defined by the CFG G
Current License: CC BY-SA 4.0
11 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
Aug 23, 2019 at 22:27 | comment | added | D.W.♦ | cs.stackexchange.com/q/11315/755 | |
Aug 23, 2019 at 21:03 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
Apr 25, 2019 at 21:00 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
Mar 28, 2019 at 21:14 | comment | added | user102119 | My answer was that there are 3 cases: 1) from any state we are in: A call is made to epsilon: the difference between a and b is unchanged. Case 2&3: Either the production aSbS or bSaS will be called, which will eventually cause a and b to be printed (exactly once each). In the recursive calls to S, the same thing happens: a and b are eventually printed once each from that recursive call (which makes the difference between a's and b's equal to zero) or epsilon is called which also doesn't change the difference between number of a's and b's. | |
Mar 27, 2019 at 1:35 | comment | added | John L. | Have you understood similar examples in your course material? What have you tried? Where did you get stuck? For example, have you proved the words generated by grammar must have equal number of $a$'s and $b$'s? | |
Mar 26, 2019 at 20:56 | answer | added | lox | timeline score: 1 | |
Mar 26, 2019 at 20:48 | history | edited | user102119 | CC BY-SA 4.0 |
added 73 characters in body
|
Mar 26, 2019 at 20:47 | review | First posts | |||
Mar 27, 2019 at 1:35 | |||||
Mar 26, 2019 at 20:47 | comment | added | user102119 | @lox yes, sorry i will edit this in the question | |
Mar 26, 2019 at 20:45 | comment | added | lox | what do you mean by na(w) number of $a$'s in w? | |
Mar 26, 2019 at 20:41 | history | asked | user102119 | CC BY-SA 4.0 |