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 条

[21] ON THE EQUIVALENCE PROBLEM FOR DETERMINISTIC MULTITAPE AUTOMATA AND TRANSDUCERS
CULIK, K
KARHUMAKI, J
LECTURE NOTES IN COMPUTER SCIENCE, 1989, 349 : 468 - 479
[22] ALGORITHM FOR ESTABLISHING THE EQUIVALENCE OF DETERMINISTIC MULTITAPE AUTOMATA
Borisenko, V. I.
CYBERNETICS AND SYSTEMS ANALYSIS, 2015, 51 (05) : 720 - 729
[23] DECIDABILITY OF EQUIVALENCE FOR A CLASS OF NONDETERMINISTIC TREE-TRANSDUCERS
ANDRE, Y
DAUCHET, M
RAIRO-INFORMATIQUE THEORIQUE ET APPLICATIONS-THEORETICAL INFORMATICS AND APPLICATIONS, 1994, 28 (05): : 447 - 463
[24] An implementation of deterministic tree automata minimization
Carrasco, Rafael C.
Daciuk, Jan
Forcada, Mikel L.
IMPLEMENTATION AND APPLICATION OF AUTOMATA, 2007, 4783 : 122 - +
[25] Minimizing Deterministic Weighted Tree Automata
Maletti, Andreas
LANGUAGE AND AUTOMATA THEORY AND APPLICATIONS, 2008, 5196 : 357 - 372
[26] Minimizing deterministic weighted tree automata
Maletti, Andreas
INFORMATION AND COMPUTATION, 2009, 207 (11) : 1284 - 1299
[27] DECIDING EQUIVALENCE OF FINITE TREE AUTOMATA
SEIDL, H
LECTURE NOTES IN COMPUTER SCIENCE, 1989, 349 : 480 - 492
[28] DECIDING EQUIVALENCE OF FINITE TREE AUTOMATA
SEIDL, H
SIAM JOURNAL ON COMPUTING, 1990, 19 (03) : 424 - 437
[29] EQUIVALENCE PROBLEM OF NON-DETERMINISTIC FINITE AUTOMATA
NOZAKI, A
JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1979, 18 (01) : 8 - 17
[30] On regular tree languages and deterministic pushdown automata
Janousek, Jan
Melichar, Borivoj
ACTA INFORMATICA, 2009, 46 (07) : 533 - 547

← 1 2 3 4 5 →