Showing 0–0 of 0 results
| # | Exercise Title | Features | Description | Platform | Keywords |
|---|---|---|---|---|---|
| 1 | Pushdown Automata Acceptance Models Frameset | Programmed Instruction | Programmed Instruction Frameset discussing Pushdown Automata acceptance models. | OpenDSA | Pushdown Automata |
| 2 | Pushdown Automata Acceptance Model Equivalence Frameset | Programmed Instruction | Programmed Instruction Frameset discussing the equivalence of various Pushdown Automata acceptance models. | OpenDSA | Pushdown Automata |
| 3 | Pushdown Automata and Context Free Languages | Programmed Instruction | Programmed Instruction Frameset discussing the relationship between Pushdown Automata and context free languages. | OpenDSA | Pushdown Automata |
| 4 | Pushdown Automata Empty Stack Acceptance Frameset | Programmed Instruction | Programmed Instruction Frameset discussing Pushdown Automata and the empty stack acceptance model. | OpenDSA | Pushdown Automata |
| 5 | Pushdown Automata Introduction Frameset | Programmed Instruction | Programmed Instruction Frameset introducing Pushdown Automata and their formal definition. | OpenDSA | Pushdown Automata |
| 6 | Pushdown Automata Transitions Frameset | Programmed Instruction | Programmed Instruction Frameset discussing Pushdown Automata transition types. | OpenDSA | Pushdown Automata |
| 7 | PDA Exercise: Twice as many a's as b's | Automata Construction Exercise | User creates a Pushdowns Automata that accepts the langugage of strings that have twice as many a's as b's. | OpenDSA | Pushdown Automata |
| 8 | PDA Exercise: Equal a's to b's or c's | Automata Construction Exercise | User creates a Pushdowns Automata that accepts the langugage of a's b's and c's with as many a's as either... | OpenDSA | Pushdown Automata |
| 9 | PDA Exercise: Equal a's and b's | Automata Construction Exercise | User creates a Pushdowns Automata that accepts the langugage a^ic^jb^i. | OpenDSA | Pushdown Automata |
| 10 | PDA Exercise: String and Reverse | Automata Construction Exercise | User creates a Pushdowns Automata that accepts the langugage WcW^R. | OpenDSA | Pushdown Automata |
| 11 | Deterministic vs Nondeterministic PDAs | Programmed Instruction | Programmed Instruction Frameset discussing the differences between deterministic and non-deterministic PDAs. | OpenDSA | Pushdown Automata |
| 12 | Proof not all CFL are Deterministic | Programmed Instruction | Programmed Instruction Frameset with a proof that there exists a CFL that is not a deterministic CFL. | OpenDSA | Pushdown Automata |