EQUIVALENCE OF DETERMINISTIC PUSHDOWN AUTOMATA REVISITED

被引：0
|
作者：
Meitus, V. Yu. [1 ]
机构：
[1] Int Sci Educ Ctr Informat Technol & Syst, Kiev, Ukraine
来源：
CYBERNETICS AND SYSTEMS ANALYSIS | 2007年 / 43卷 / 02期
关键词：
deterministic pushdown automata; equivalence problem; decidability of problems; deterministic CF language;
D O I：
10.1007/s10559-007-0037-7
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
This paper briefly analyzes main ideas underlying the comparison algorithm that made it possible to prove the equivalence of deterministic pushdown automata. An example of using this algorithm is presented. The relationship of this algorithm with other results in this area is shown. Moreover, the decidability of problems associated with some classes of formal grammars is established.
引用
收藏
页码：179 / 191
页数：13
相关论文
共 50 条
12345