?
Оптимизирующие преобразования потоковых программ
С. 232–234.
Zakharov V., Темербекова Г. Г.
Language:
Russian
In book
М.: Изд-во механико-математического факультета МГУ, 2016.
Zhukova N., Regular and Chaotic Dynamics 2024 Vol. 29 No. 1 P. 174–189
The focus of the work is the investigation of chaos and closely related dynamic properties of continuous actions of almost open semigroups and $C$-semigroups. The class of dynamical systems $(S, X)$ defined such semigroups $S$ is denoted by $\frak A.$ These semigroups contain, in particular, cascades, semiflows and groups of homeomorphisms. We extend the Devaney ...
Added: February 11, 2024
Бурков А. А., Информационно-управляющие системы 2021 Vol. 5 P. 51–58
Introduction: Currently, the issues of Internet of Things technology are being actively studied. The operation of a large number of various self-powered sensors is within the framework of a massive machine-type communication scenario, using random access methods. Topical issues in this type of communication are how to reduce the transmission signal power and to increase ...
Added: September 26, 2023
The symmetric Post Correspondence Problem, and errata for the freeness problem for matrix semigroups
Birget J., Talambutsa A., International Journal of Algebra and Computation 2022 Vol. 32 No. 6 P. 1261–1274
In this paper, we define the symmetric Post Correspondence Problem (PCP) and prove that it is undecidable. As an application, we show that the original proof of undecidability of the freeness problem for 3×3 integer matrix semigroups works for the symmetric PCP, but not for the PCP in general. ...
Added: December 9, 2022
Blank M., Advances in Mathematics 2022 Vol. 406 Article 108529
We study measure-theoretical aspects of torus piecewise isometries.
Not much is known about this type of dynamical systems, except for
the special case of one-dimensional interval exchange mappings. The
last case is fundamentally different from the general situation
in the presence of an invariant measure (Lebesgue measure), which
helps a lot in the analysis. Due to the absence of good ...
Added: June 26, 2022
Gnatenko A., Zakharov V., Automatic Control and Computer Sciences 2021 Vol. 55 No. 7 P. 776–785
Sequential reactive systems include programs and devices that work with two streams of
data and convert input streams of data into output streams. Such information processing systems
include controllers, device drivers, computer interpreters. The results of operation of such computing
systems are infinite sequences of pairs of events of the request-response type, and, therefore, finite
transducers are most often ...
Added: January 17, 2022
Zakharov V., Automatic Control and Computer Sciences (AC&CS), Switzerland 2021 Vol. 55 No. 7 P. 670–701
Finite transducers, two-tape automata, and biautomata are related computational models
descended from the concept of finite-state automaton. In these models an automaton controls two
heads that read or write symbols on the tapes in the one-way mode. The computations of these three
types of automata show many common features, and it is surprising that the methods for analyzing ...
Added: January 17, 2022
Gnatenko A., Zakharov V., Моделирование и анализ информационных систем 2021 Т. 28 № 4 С. 356–371
Sequential reactive systems are computer programs or hardware devices which process the flows of input data or control signals and output the streams of instructions or responses. When designing such systems one needs formal specification languages capable of expressing the relationships between the input and output flows. Previously, we introduced a family of such specification ...
Added: January 17, 2022
Gnatenko A., Zakharov V., Моделирование и анализ информационных систем 2020 Т. 27 № 4 С. 428–441
Sequential reactive systems include programs and devices that work with two streams of data and convert input streams ofdata into output streams. Such information processing systems include controllers, device drivers, computer interpreters.e result of the operation of such computing systems are innite sequences of pairs of events of the request–responsetype, and, therefore, nite transducers are ...
Added: January 31, 2021
Gnatenko A., Zakharov V., Системная информатика 2020 Vol. 17 P. 21–32
Sequential reactive systems such as controllers, device drivers, computer interpreters operate with two data streams and transform input streams of data (control signals, instructions) into output streams of control signals (instructions, data). Finite state transducers are widely used as an adequate formal model for information processing systems of this kind. Since runs of transducers develop ...
Added: November 9, 2020
Zakharov V., Моделирование и анализ информационных систем 2020 Т. 27 № 3 С. 260–303
Finite transducers, two-tape automata, and biautomata are related computational models descended from the concept of Finite State Automaton. In these models an automaton controls two heads that read or write symbols on the tapes in one-way mode. The computations of these three types of automata show many common features, and it is surprising that the ...
Added: September 28, 2020
Zakharov V., Жайлауова Ш. Р., В кн.: Материалы XIII Международного семинара "Дискретная математика и ее приложения" имени академика О.Б. Лупанова (Москва, МГУ, 17-22 июня 2019).: М.: Изд-во механико-математического факультета МГУ, 2019. С. 272–274.
В данной статье мы продолжаем поиск и исследование новых классов недетерминированных автоматов-преобразователей с разрешимой проблемой эквивалентности. Цель исследования~--- провести как можно более точную и подробную демаркацию границы между разрешимыми и неразрешимыми случаями проблемы эквивалентности для рассматриваемой модели вычислений. Мы рассматриваем один класс недетерминированных автоматов, работающих над выходным алфавитом из одной буквы. Характерная особенность рассматриваемых автоматов-преобразователей ...
Added: October 17, 2019
Gnatenko A., Zakharov V., В кн.: Материалы XIII Международного семинара "Дискретная математика и ее приложения" имени академика О.Б. Лупанова (Москва, МГУ, 17-22 июня 2019).: М.: Изд-во механико-математического факультета МГУ, 2019. С. 263–266.
Описаны синтаксис и семантика нового расширения Reg-CTL* темпоральной логики деревьев вычислений CTL*, предназначенного для спецификации и верификации вычислений последовательных реагирующих систем. Поеказано, что задача верификации моделей автоматов-преобразователей относительно выполнимости формул логики CTL* является PSPACE-полной. ...
Added: October 17, 2019
Blank M., Russian Mathematical Surveys 2019 Vol. 74 No. 4 P. 758–760
We discuss the recurrence property, based on the representation of trajectories of the semigroup as realizations of a certain Markov chain for which necessary and sufficient conditions for the recurrence were obtained recently in [Blank2019]. Remark that a direct generalization of the recurrence property does not work well in the case of the semigroup action and one needs to make ...
Added: October 8, 2019