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 10861
Questions about state machines with a single stack for memory. They characterize the class of context-free languages.
2
votes
1
answer
3k
views
Can we push and pop both at a single transition in a PDA?
Let say I have a pda :
δ(q1,a,Z)=(q2,aZ)
δ(q2,a,aZ)=(q2,bZ)
Is this allowed....
you can see that in δ(q2,a,aZ)=(q2,bZ), we are basically popping 'a' and pushing 'b' for a single transition...
Is …
- 55
1
vote
1
answer
1k
views
Approaches to Solve PDA
There is a saying by Computer Science Professor's everywhere :
PDA Checks the intelligence of Students, as certainly there is no approach except power and imagination
of mind to solve problems and de …
- 55