Quasivarieties of automata. Connections with quasigroups (Q1091144): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebras with a Scheme of Operators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3043348 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5650903 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5596857 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4053830 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 10:36, 18 June 2024

scientific article
Language Label Description Also known as
English
Quasivarieties of automata. Connections with quasigroups
scientific article

    Statements

    Quasivarieties of automata. Connections with quasigroups (English)
    0 references
    0 references
    1985
    0 references
    \textit{P. J. Higgins} [Math. Nachr. 27, 115-132 (1963; Zbl 0117.259)] gave an invariant characteristic of varieties of many-sorted algebras (cf. \textit{B. I. Plotkin}, \textit{Ts. E. Dididze}, and \textit{E. M. Kublanova} [Kibernetika 1977, No.1, 47-54 (1977; Zbl 0356.94062)] for its application to automata). The corresponding characteristic of quasivarieties, that generalizes Mal'tsev's well-known theorem, can be found in the author's ''Quasivarieties in many-sorted algebras'' [Theses of Brief Communications, Int. Math. Conf., Warsaw 1983, Section II, Algebra, p. 20 (1983)]: A class of many-sorted algebras is a quasivariety if, and only if, it is closed relative to filtered products, is hereditary and contains the identity algebra. In our paper, this characteristic is applied to automata. Our paper consists of three sections. The first two are devoted to quasivarieties of automata. We define classes of automata, saturated relative to input and output signals. Section 3 is devoted to an application of the methods of many-sorted algebras to the theory of quasigroups. This application is founded upon the concept of reversible automaton.
    0 references
    many-sorted algebras
    0 references
    quasivariety
    0 references
    filtered products
    0 references
    quasivarieties of automata
    0 references
    reversible automaton
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references