110 likes | 121 Vues
DPDA Deterministic PDA. Deterministic PDA: DPDA. Allowed transitions:. (deterministic choices). Allowed transitions:. (deterministic choices). Not allowed:. (non deterministic choices). DPDA example. Definition:. A language is deterministic context-free
E N D
DPDADeterministic PDA Costas Busch - RPI
Deterministic PDA: DPDA Allowed transitions: (deterministic choices) Costas Busch - RPI
Allowed transitions: (deterministic choices) Costas Busch - RPI
Not allowed: (non deterministic choices) Costas Busch - RPI
DPDA example Costas Busch - RPI
Definition: A language is deterministic context-free if there exists some DPDA that accepts it Example: The language is deterministic context-free Costas Busch - RPI
Example of Non-DPDA (PDA) Costas Busch - RPI
Not allowed in DPDAs Costas Busch - RPI
PDAs Have More Power thanDPDAs Costas Busch - RPI
It holds that: Deterministic Context-Free Languages (DPDA) Context-Free Languages PDAs Since every DPDA is also a PDA Costas Busch - RPI
We will show that there exists a context-free language which is not accepted by any DPDA We will actually show: Deterministic Context-Free Languages (DPDA) Context-Free Languages (PDA) Costas Busch - RPI