Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with pushdown-automata
Search options not deleted
user 11974
Questions about state machines with a single stack for memory. They characterize the class of context-free languages.
9
votes
3
answers
4k
views
Demonstrate that DPDA is closed under complement by construction
I've been trying for quite some extended time to find a construction so that I can formally demonstrate that a deterministic PDA is closed under complementation. However, it happens that every idea I …
- 337
5
votes
Demonstrate that DPDA is closed under complement by construction
I didn't have time to write this before but I found an answer. Here is what I did:
Let $O$ be the original $PDA$. We will construct a new $PDA$, call it $M$ ($M$ stands for modified).
To find the co …
- 337