Abstract
A method is proposed to solve the recognition problem for the input word of a linear machine in the interval statement reduced to solving linear systems of equations with an exact matrix and interval right-hand side.
Similar content being viewed by others
References
Huffman, D.A., Canonical Forms for Information-Lossless Finite-State Logical Machines, IRE Trans. Circuit Theory, 1959, vol. ST-6,Sp. Suppl., pp. 41–59.
Gill, A., Linear Sequential Circuits-Analysis, Synthesis, and. Applications, New York: McGraw-Hill, 1966; Moscow: Nauka, 1974.
Speranskii, D.V., Lektsii po teorii eksperimentov s konechnymi avtomatami, (Lectures on Theory of Experiments of Finite Automates), Moscow: Internet-Univ. Inform. Tekhnol., BINOM, 2010.
Kalmykov, S.A., Shokin, Yu.A., and Yuldashev, Z.Kh., Metody interval’nogo analiza, (Methods of Interval Analysis), Novosibirsk: Nauka, 1986.
Kupriyanova, L.V., Speranskii, D.V., and Samoilov, V.G., Interval Arithmetic over GF(p) Field, Vychisl. Tekhnol., 2002, vol. 7, no. 6, pp. 54–64.
Author information
Authors and Affiliations
Corresponding author
Additional information
Original Russian Text © D.V. Speranskii, 2012, published in Avtomatika i Vychislitel’naya Tekhnika, 2012, No. 2, pp. 50–56.
About this article
Cite this article
Speranskii, D.V. Interval statement of the input word recognition problem for a linear machine. Aut. Conrol Comp. Sci. 46, 90–94 (2012). https://doi.org/10.3103/S014641161202006X
Received:
Published:
Issue Date:
DOI: https://doi.org/10.3103/S014641161202006X