S-SEMIGROUPS OF AUTOMATA

被引：2

|

作者：

FLECK, AC

HEDETNIEMI, ST

OEHMKE, RH

机构：

来源：

JOURNAL OF THE ACM | 1972年 / 19卷 / 01期

关键词：

D O I：

10.1145/321679.321681

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

引用

收藏

页码：3 / +

页数：1

相关论文

共 50 条

[41] Abstract Characterization of Semigroups of Input Signals of Universal Planar Automata
Molchanov, V. A.
IZVESTIYA SARATOVSKOGO UNIVERSITETA NOVAYA SERIYA-MATEMATIKA MEKHANIKA INFORMATIKA, 2015, 15 (01): : 113 - 121
[42] A PROGRAMMING LANGUAGE FOR SYMBOLIC COMPUTATION OF REGULAR LANGUAGES, AUTOMATA AND SEMIGROUPS
CHAMPARNAUD, JM
LECTURE NOTES IN COMPUTER SCIENCE, 1992, 577 : 605 - 606
[43] Ranks of finite semigroups of one-dimensional cellular automata
Alonso Castillo-Ramirez
Maximilien Gadouleau
Semigroup Forum, 2016, 93 : 347 - 362
[44] AN EFFECTIVE LOWER BOUND FOR GROUP COMPLEXITY OF FINITE SEMIGROUPS AND AUTOMATA
Henckell, Karsten
Rhodes, John
Steinberg, Benjamin
TRANSACTIONS OF THE AMERICAN MATHEMATICAL SOCIETY, 2012, 364 (04) : 1815 - 1857
[45] Elementary Definability of the Class of Universal Planar Automata in the Class of Semigroups
Molchanov, V. A.
SIBERIAN MATHEMATICAL JOURNAL, 2019, 60 (06) : 1089 - 1098
[46] ISOMORPHISM TESTING FOR GRAPHS, SEMIGROUPS, AND FINITE AUTOMATA ARE POLYNOMIALLY EQUIVALENT PROBLEMS
BOOTH, KS
SIAM JOURNAL ON COMPUTING, 1978, 7 (03) : 273 - 279
[47] From post systems to the reachability problems for matrix semigroups and multicounter automata
Potapov, I
DEVELOPMENTS IN LANGUAGE THEORY, PROCEEDINGS, 2004, 3340 : 345 - 356
[48] Finite automata over a direct product of free semigroups and groups and languages
1600, (26):
[49] BIPREFIX CODES, INVERSE-SEMIGROUPS AND SYNTACTIC MONOIDS OF INJECTIVE AUTOMATA
HALL, TE
THEORETICAL COMPUTER SCIENCE, 1984, 32 (1-2) : 201 - 213
[50] Auslander's theorem on discontinuous semigroups and crystallographic semigroups
Soifer, GA
COMMUNICATIONS IN ALGEBRA, 1996, 24 (04) : 1435 - 1444

← 1 2 3 4 5 →