Finiteness of the set of automaton Post bases with solvable completeness problem

被引：0

|

作者：

机构：

来源：

Discrete Math Appl | / 5卷 / 475-482期

关键词：

D O I：

暂无

中图分类号：

学科分类号：

摘要：

引用

收藏

相关论文

共 28 条

[1] On the classification of Post automaton bases by the decidability of the A-completeness property for definite automata
Zhuk, D. N.
DISCRETE MATHEMATICS AND APPLICATIONS, 2010, 20 (03): : 337 - 355
[2] ON THE FINITENESS PROBLEM FOR AUTOMATON (SEMI) GROUPS
Akhavi, Ali
Klimann, Ines
Lombardy, Sylvain
Mairesse, Jean
Picantin, Matthieu
INTERNATIONAL JOURNAL OF ALGEBRA AND COMPUTATION, 2012, 22 (06)
[3] THE FINITENESS PROBLEM FOR AUTOMATON SEMIGROUPS IS UNDECIDABLE
Gillibert, Pierre
INTERNATIONAL JOURNAL OF ALGEBRA AND COMPUTATION, 2014, 24 (01) : 1 - 9
[4] The conjugacy problem in automaton groups is not solvable
Sunic, Zoran
Ventura, Enric
JOURNAL OF ALGEBRA, 2012, 364 : 148 - 154
[5] On decidability of the completeness problem for special systems of automaton functions
Babin, D.N.
Discrete Mathematics and Applications, 6 (05):
[6] THE FINITENESS PROBLEM OF MINIMAL BASES FOR ANY SURFACES
BODENDIEK, R
WAGNER, K
ABHANDLUNGEN AUS DEM MATHEMATISCHEN SEMINAR DER UNIVERSITAT HAMBURG, 1985, 55 : 31 - 52
[7] Permutive One-Way Cellular Automata and the Finiteness Problem for Automaton Groups
Delacourt, Martin
Ollinger, Nicolas
UNVEILING DYNAMICS AND COMPLEXITY, CIE 2017, 2017, 10307 : 234 - 245
[8] Solvability of the Problem of Completeness of Automaton Basis Depending on its Boolean Part
Babin, D. N.
MOSCOW UNIVERSITY MATHEMATICS BULLETIN, 2019, 74 (01) : 32 - 34
[9] Solvability of the Problem of Completeness of Automaton Basis Depending on its Boolean Part
D. N. Babin
Moscow University Mathematics Bulletin, 2019, 74 : 32 - 34
[10] SOLUTION OF SETTING PROBLEM FOR AN AUTOMATON WITH PARTITION ON SET OF STATES
KORNOUSH.EK
AUTOMATION AND REMOTE CONTROL, 1971, 32 (01) : 150 - &