L(A) = L(B)?

Q3 Computer Science Electronic Notes in Theoretical Computer Science Pub Date : 1997-01-01 DOI:10.1016/S1571-0661(05)80430-X

Géraud Sénizergues

引用次数: 0

Abstract

The equivalence problem for deterministic pushdown automata is shown to be decidable. We exhibit a complete formal system for deducing equivalent pairs of deterministic rational boolean series on the alphabet associated with a dpda M.

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

L(a) = L(b)？

证明了确定性下推自动机的等价问题是可决定的。我们展示了一个完整的形式系统，用于推导与dpda M相关的字母表上的确定性有理布尔级数的等价对。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文去求助

来源期刊

Electronic Notes in Theoretical Computer Science Computer Science-Computer Science (all)

自引率

0.00%

发文量

期刊介绍： ENTCS is a venue for the rapid electronic publication of the proceedings of conferences, of lecture notes, monographs and other similar material for which quick publication and the availability on the electronic media is appropriate. Organizers of conferences whose proceedings appear in ENTCS, and authors of other material appearing as a volume in the series are allowed to make hard copies of the relevant volume for limited distribution. For example, conference proceedings may be distributed to participants at the meeting, and lecture notes can be distributed to those taking a course based on the material in the volume.

期刊最新文献

Preface Murphree's Numerical Term Logic Tableaux A Note on Constructive Interpolation for the Multi-Modal Logic Km Paracomplete Logics Dual to the Genuine Paraconsistent Logics: The Three-valued Case Building a Maximal Independent Set for the Vertex-coloring Problem on Planar Graphs