Timeline for How do we check $x ≠ y$ in $PDA$ for $L = \{xy | x, y \in (0 + 1)^*, |x| = |y|, x ≠ y\}?$
Current License: CC BY-SA 4.0
17 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| S Jul 2, 2023 at 22:19 | vote | accept | S. M. | ||
| S Jul 2, 2023 at 22:19 | vote | accept | S. M. | ||
| S Jul 2, 2023 at 22:19 | |||||
| May 10, 2022 at 1:04 | vote | accept | S. M. | ||
| S Jul 2, 2023 at 22:19 | |||||
| May 10, 2022 at 1:04 | answer | added | S. M. | timeline score: 0 | |
| May 9, 2022 at 21:27 | history | edited | S. M. | CC BY-SA 4.0 |
edited tags
|
| May 9, 2022 at 15:25 | history | edited | S. M. | CC BY-SA 4.0 |
edited body; edited title
|
| May 9, 2022 at 9:33 | review | Close votes | |||
| May 14, 2022 at 3:03 | |||||
| May 9, 2022 at 9:24 | comment | added | Hendrik Jan | Also Raphael explained how to build how to build a PDA for the same language: Pushdown Automaton for L={w1w2:|w1|=|w2|,w1≠w2} | |
| May 9, 2022 at 9:13 | comment | added | Hendrik Jan | Does this answer your question? PDA for { xy : |x| = |y|, x ≠ y} from its grammar, and intuition behind it | |
| May 9, 2022 at 6:40 | history | edited | S. M. | CC BY-SA 4.0 |
deleted 2 characters in body
|
| May 9, 2022 at 5:14 | answer | added | user326210 | timeline score: 9 | |
| May 9, 2022 at 3:38 | comment | added | Russel | And if you want to start with a PDA without converting a CFG, you can use the idea in the link given by @D.W. | |
| May 9, 2022 at 3:31 | comment | added | Russel | You said, you already know that the language is context-free, but you are still seeking for a PDA for it. Does it mean you have a CFG for the language? If so, there is a general way of converting a CFG to a PDA. You can easily search for it. But here is a link you can check. | |
| May 9, 2022 at 3:31 | comment | added | S. M. | @D.W. your linked answer I already seen, and that based on cfg, but I want to design pda and want to check $x=!y$. | |
| May 9, 2022 at 3:28 | comment | added | D.W.♦ | This looks like a duplicate of cs.stackexchange.com/q/307/755. In particular, see the answer there, and convert that context-free grammar to a PDA. | |
| May 9, 2022 at 3:20 | history | edited | S. M. | CC BY-SA 4.0 |
edited body
|
| May 9, 2022 at 3:13 | history | asked | S. M. | CC BY-SA 4.0 |