Decidability of equivalence for deterministic synchronized tree automata

被引：0

|

作者：

Univ of Turku, Turku, Finland ^{[1
]}

机构：

来源：

Theor Comput Sci | / 1-2卷 / 171-192期

关键词：

Number:; -; Acronym:; Sponsor: Academy of Finland;

D O I：

暂无

中图分类号：

学科分类号：

摘要：

引用

收藏

相关论文

共 50 条

[1] Decidability of equivalence for deterministic synchronized tree automata
Salomaa, K
TAPSOFT '95: THEORY AND PRACTICE OF SOFTWARE DEVELOPMENT, 1995, 915 : 140 - 154
[2] Decidability of equivalence for deterministic synchronized tree automata
Salomaa, K
THEORETICAL COMPUTER SCIENCE, 1996, 167 (1-2) : 171 - 192
[3] DECIDABILITY OF EQUIVALENCE FOR DETERMINISTIC STATELESS PUSHDOWN AUTOMATA
OYAMAGUCHI, M
HONDA, N
INFORMATION AND CONTROL, 1978, 38 (03): : 367 - 376
[4] DECIDABILITY OF THE EQUIVALENCE PROBLEM FOR DETERMINISTIC PUSHDOWN-AUTOMATA
MEITUS, VY
CYBERNETICS AND SYSTEMS ANALYSIS, 1992, 28 (05) : 672 - 690
[5] SYNCHRONIZABLE DETERMINISTIC PUSHDOWN-AUTOMATA AND THE DECIDABILITY OF THEIR EQUIVALENCE
CULIK, K
KARHUMAKI, J
ACTA INFORMATICA, 1986, 23 (05) : 597 - 605
[6] DECIDABILITY OF THE EQUIVALENCE PROBLEM FOR SYNCHRONOUS DETERMINISTIC PUSHDOWN-AUTOMATA
NEPOMNJASHCHAJA, AS
LECTURE NOTES IN COMPUTER SCIENCE, 1984, 176 : 425 - 432
[7] DECIDABILITY OF THE EQUIVALENCE PROBLEM FOR SYNCHRONOUS DETERMINISTIC PUSHDOWN-STORE AUTOMATA
NEPOMNYASHCHAYA, AS
PROGRAMMING AND COMPUTER SOFTWARE, 1984, 10 (05) : 233 - 239
[8] ON THE DECIDABILITY OF EQUIVALENCE FOR DETERMINISTIC PUSHDOWN TRANSDUCERS
IBARRA, OH
ROSIER, LE
INFORMATION PROCESSING LETTERS, 1981, 13 (03) : 89 - 93
[9] DECIDABILITY OF EQUIVALENCE FOR DETERMINISTIC FINITE TRANSDUCERS
BLATTNER, M
HEAD, T
JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1979, 19 (01) : 45 - 49
[10] SYNCHRONIZED TREE AUTOMATA
SALOMAA, K
THEORETICAL COMPUTER SCIENCE, 1994, 127 (01) : 25 - 51

← 1 2 3 4 5 →