Equivalence problems for deterministic context-free languages and monadic recursion schemes
作者：
Highlights：
•
摘要
The equivalence problem for deterministic context-free languages is shown to be decidable if and only if the strong equivalence problem for monadic recursion schemes is decidable.
论文关键词：
论文评审过程：Received 29 September 1975, Revised 30 September 1976, Available online 31 December 2007.
论文官网地址：https://doi.org/10.1016/S0022-0000(77)80019-6
