Complexity of the characteristic semi-groups the direct products of „AG“ asynchronous automata of the strongly connected determined analogs the extensions associated with DFASC2 isomorfisms

  • Stanisław Bocian TABOR
Keywords: DFASC2, complexity, automatons

Abstract

The paper presents the assumption and the evidence is carried out of the direct product complexity of character-istic semi-groups of any number (“ ”) of deterministic, finite, asynchronous, highly consistent DFASC2. automata. The characteristic semi-group of the automaton interferes in the computational algorithm of the generalized homoeo-morphism of the automatons. Then determination the com-plexity of the characteristic semi-group enables to estimate the complexity of the computational generalized homoeo-morphism for the other classes of automatons. In the range of the mathematical model the conception of the determined analog of the extension of the automaton associated with the isomorphism g0, g1 ,…, gq-1 where q is the grade of the extensions, with the suitable assumptions it simulates the automaton variable in time. The variable automaton in time is the adequate mathematical model for the many technical and computational processes of the real time. The direct product of automatons can be considered as the realization- parallel calculations accordingly

References

Bocian S. , Rozprawa doktorka , Politechnika Poznańska, 1986.

Bocian S. , A new method of calculating the smallest common multiple, w : Computational Topology and Geometry and Computation in Teaching Mathematics, pod red. Eladio Dominquez Murillo, Antonio Quintero Toscano, Jose Luis Vincente Cordoba, Universidad de Sevilla 1987 s. 25 – 41.

Bocian S. , Złożoność półgrupy charakterystycznej iloczynu prostego automatów asynchronicznych silnie spójnych ustalonych analogów rozszerzeń związanych z izomorfizmami. TRANSCOMP – XIV International Conference Computer Systems Aided Sciences, Industry And Transport (Logistyka 6/2010), Zakopane 2010.

Bocian S. , Złożoność półgrupy charakterystycznej iloczynu prostego automatów z klasy , Pojazdy Szynowe nr 1/2011, IPS – TABOR Poznań 2012 r.

Bocian S., Inteligentne podsystemy mechatroniczne w badaniach i sterowaniu pojazdów szynowych, ( Monografia ) Poznań 2012 r.

Bocian S., Nowy sposób wyznaczania najmniejszej wspólnej wielokrotności (NWW) liczb naturalnych. Interpretacja graficzna, wizualizacja oraz programy w języku BASIC i C++ TRANSCOMP – XVI INTERNATIONAL CONFERENCE COMPUTER SYSTEMS AIDED SCIENCES, INDUSTRY AND TRANSPORT (Technika Transportu Szynowego –TTS, 9/2012), Zakopane 2012.

Published
2018-06-30
Section
Articles