4_deterministic_context_free_languages.md

2.4 Deterministic Context-Free Languages

定义2.39 DPDA

A deterministic pushdown automaton is a 6-tuple($$Q,\Sigma,\Gamma,\sigma,q_0,F$$)

TODO

相比于DFA，里面有$$\epsilon$$-moves，和$$\epsilon$$-stack moves，但不允许双$$\epsilon$$

定理2.42（{DCFLs}的封闭性）

The class of DCFLs is closed under complementation.

DCFLs对$$\cup ,\cdot ,*,reversal$$ 不封闭

TODO