STRUCTURE AND TRANSITION-PRESERVING FUNCTIONS OF FINITE AUTOMATA

被引：31

作者：

BAVEL, Z

机构：

[1] Department of Mathematics, Southern Illinois University, Carbondale, Illinois

来源：

JOURNAL OF THE ACM | 1968年 / 15卷 / 01期

关键词：

D O I：

10.1145/321439.321448

中图分类号：

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

学科分类号：

0812 ;

摘要：

Arbitrary finite automata are decomposed into their major substructures, the primaries. Several characterizations of homomorphisms, endomorphisms, isomorphisms, and automorphisms of arbitrary finite automata are presented via reduction to the primaries of the automata. Various characterizations of these transition-preserving functions on singly generated automata are presented and are used as a basis for the reduction. Estimates on the number of functions of each type are given. © 1968, ACM. All right reserved.

引用

页码：135 / &

共 12 条

[1]

ARBIB MA, TO BE PUBLISHED

[2] GROUPS OF AUTOMORPHISMS AND SETS OF EQUIVALENCE CLASSES OF INPUT FOR AUTOMATA [J].