Analysis of Automata Models Determined on Varieties over Finite Ring

被引:1
|
作者
Skobelev, V. V. [1 ]
机构
[1] Natl Acad Sci Ukraine, Inst Appl Math & Mech, Donetsk, Ukraine
关键词
automata models; prescribed set of trajectories; homomorphism; automata with source-states; automata with twins-states;
D O I
10.1615/JAutomatInfScien.v45.i8.30
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
There are analyzed automata models determined over finite ring on variety with algebra and on parametrized variety with the prescribed set of trajectories. Homomorphisms of indicated structures are determined. Some method is proposed to investigate this homomorphism aimed at designing for any automata model determined in an initial structure its image determined in a resulting structure. The sets of group automata, automata with source-states, automate with flow-states, automata with twins-states and automata with 1-distinguishable states and reversible automata are characterized.
引用
收藏
页码:21 / 31
页数:11
相关论文
共 50 条
  • [31] Finite basis of ideal terms in ideal determined varieties
    Chajda, I
    Halas, R
    ALGEBRA UNIVERSALIS, 1997, 37 (02) : 243 - 252
  • [32] Finite basis of ideal terms in ideal determined varieties
    I. Chajda
    R. Halas
    algebra universalis, 1997, 37 : 243 - 252
  • [33] FINITELY DETERMINED ARITHMETICAL VARIETIES NEED NOT BE UNIVERSALLY FINITE
    QUACKENBUSH, RW
    ALGEBRA UNIVERSALIS, 1986, 22 (2-3) : 302 - 303
  • [34] GROTHENDIECK RING OF VARIETIES WITH ACTIONS OF FINITE GROUPS
    Gusein-Zade, S. M.
    Luengo, I
    Melle-Hernandez, A.
    PROCEEDINGS OF THE EDINBURGH MATHEMATICAL SOCIETY, 2019, 62 (04) : 925 - 948
  • [36] Weighted finite automata over strong bimonoids
    Droste, Manfred
    Stueber, Torsten
    Vogler, Heiko
    INFORMATION SCIENCES, 2010, 180 (01) : 156 - 166
  • [37] Unambiguous finite automata over a unary alphabet
    Okhotin, Alexander
    INFORMATION AND COMPUTATION, 2012, 212 : 15 - 36
  • [38] Automata over Finite T-Quasigroups
    Skobelev, V. V.
    Skobelev, V. G.
    CYBERNETICS AND SYSTEMS ANALYSIS, 2018, 54 (03) : 345 - 356
  • [39] The accepting power of finite automata over groups
    Mitrana, V
    Stiebe, R
    NEW TRENDS IN FORMAL LANGUAGES, 1997, 1218 : 39 - 48
  • [40] Unambiguous Finite Automata over a Unary Alphabet
    Okhotin, Alexander
    MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2010, 2010, 6281 : 556 - 567