|Table of Contents|

Factor Automata of Monoid-Matrix Type Automata(PDF)

《南京师大学报（自然科学版）》[ISSN:1001-4616/CN:32-1239/N]

Issue:
2017年02期
Page:
39-
Research Field:
·数学·
Publishing date:

Info

Title:
Factor Automata of Monoid-Matrix Type Automata
Author(s):
Xu Hui1; Tian Jing2
(1.School of Science,Air Force Engineering University,Xi’an 710051,China)(2.School of Economy and Finance,Xi’an International Studies University,Xi’an 710128,China)
Keywords:
Monoid-matrix type automaton; homomorphism; congruence; factor automaton
PACS:
O152.7
DOI:
10.3969/j.issn.1001-4616.2017.02.007
Abstract:
In this paper,we start with a monoid homomorphism. Then we construct an(n,S)-automaton homomorphism and a congruence. Further,a new automaton(that is,factor automaton)is contructed on the quotient set. Also,we prove that factor automaton is isomorphic to homomorphic image. Based on these,we introduce two binary relations L and R on(n,S)-automaton and prove that they are commutative.

References:

[1] FLECK A C. Isomorphism groups of automata[J]. Journal of the association for computing machinery,1962,9(4):469-476.
[2]ITO M. Algebraic theory of automata and languages[M]. Singapore:World Scientific Press,2004.
[3]TIAN J,ZHAO X Z. Representations of commutative asynchronous automata[J]. Journal of computer and system sciences,2012,78:504-516.
[4]TIAN J,ZHAO X Z,SHAO Y. On structure and representations of cyclic automata[J]. Theoretical computer science,2016,609:344-360.
[5]XU H,TIAN J,ZHAO X Z. Monoid-matrix type automaton[J]. Theoretical computer science,2014,520:1-10.
[6]HOWIE J M. Automata and languages[M]. Oxford:Clarendon Press,1991.

Memo

Memo:
-
Last Update: 2017-06-30