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 177499
Questions about state machines with a single stack for memory. They characterize the class of context-free languages.
1
vote
1
answer
62
views
Show that L={a^nb^m:n>m} is a deterministic context-free language
Above language L is a context-free language, but I found that this language can only represented by the NPDA. Because the conditions of DPDA(Deterministic PDA) says:
If $\delta(q, \lambda, b)$ is not …
- 46
1
vote
Accepted
Non-deterministic Pushdown Automaton to Context-Free Grammar
I know it's too late for to answer your question, but here it is:
When you converts NPDA to certain CFG by using those methods you wrote, it must be clear that the NPDA accepts the CFL when its stack …
- 46