Nondeterminism and boolean operations in pda's
作者：
Highlights：
•
摘要
There are nondeterministic context-free languages that cannot be expressed as a Boolean formula over deterministic context-free languages. The closure of the context-free languages under intersection does not yield closure under complementation.
论文关键词：
论文评审过程：Received 14 March 1977, Revised 15 June 1977, Available online 2 December 2003.
论文官网地址：https://doi.org/10.1016/0022-0000(78)90030-2
