Abstract
For nonstationary bilinear finite state machines over the field GF(p), we prove existence criteria of synchronizing, homing and diagnostic sequences formulated in terms of characteristic matrices of the finite state machines. For synchronizing sequences, we propose a method to construct them.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Gill, A., Introduction to the Theory of Finite-State Machines, New York: McGraw-Hill, 1962. Translated under the title Vvedenie v teoriyu konechnykh avtomatov, Moscow: Nauka, 1966.
Speranskii, D.V., Lektsii po teorii eksperimentov s konechnymi avtomatami (Lectures on Experiment Theory with Finite Automata), Moscow: Binom, 2010.
Kurosh, A.G., Kurs vysshei algebry (A Course in Higher Algebra), Moscow: Nauka, 1976.
Author information
Authors and Affiliations
Corresponding author
Additional information
Original Russian Text © D.V. Speranskii, 2015, published in Avtomatika i Telemekhanika, 2015, No. 9, pp. 161–174.
Rights and permissions
About this article
Cite this article
Speranskii, D.V. Experiments with nonstationary bilinear finite state machines. Autom Remote Control 76, 1644–1654 (2015). https://doi.org/10.1134/S0005117915090106
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1134/S0005117915090106