For citation:
Vagarina N. . Criteria of universality Finite determined machine for machines without loss of informating class. Izvestiya of Saratov University. Mathematics. Mechanics. Informatics, 2005, vol. 5, iss. 1, pp. 99-107. DOI: 10.18500/1816-9791-2005-5-1-99-107, EDN: JSGGJF
Criteria of universality Finite determined machine for machines without loss of informating class
Finite determined machine is one of the most popular mathematical models of complex discrete systems. In this article possibilities of the application generable set of automate transformation groups are investigated. It is considered relatively to the decision of denumerability problem. Approach to a organization goal-directed behavior problem decision in class of complex discrete systems described by one-to-one transformations (without loss of information) is offer in this scientific work. The main result of this work is definition the form of automate substitutions and conditions of automate universality for complex systems without loss of information.
- М. А. Арбиб (ред.), Алгебраическая теория автоматов, языков и полугрупп, пер. с англ., М., 1975
- Богомолов А. М., Сытник А. А., Твердохлебов В. А., Автоматные модели и рекурсивный конструктивизм, Саратов, 1992
- Кострикин А. И., Введение в алгебру, М., 1977
- Пикар С., “О базисах симметрической группы”, Кибернетический сборник, 1965, № 1
- Сытник А. А., “Методы и модели восстановления поведения автоматов”, Автоматика и телемеханика, 1992, № 11
- Sytnik A. A., Posohina N. I., “On some methods of discret systems behaviour simulation”, CASYS’97: The 1st Intem. Conf. on computing anticipatory systems (Liege, 1997)
- 846 reads