Abstract
An exact estimate is given for the length of a minimal zero word (sequence). This estimate equals q+2 for second-order matrices over a finite field GF(q). The correspondence problem is proved to be undecidable for matrices with rational elements.
Similar content being viewed by others
References
M. Paterson, “Unsolvability in 3×3_matrices,” Studies in Applied Mathematics, 49, 105–107 (1970).
O. Bournez and M. Branicky, “The mortality problem for matrices of low dimensions,” Theory Comput. Systems, 35, 433–448 (2002).
I. K. Rystsov, “Representation of regular ideals in finite automata,” Cybernetics and Systems Analysis, No. 5, 48–58 (2003).
R. Hartshorne, Fundamentals of Projective Geometry [Russian translation], Mir, Moscow (1970).
A. A. Albert, “Finite fields,” Kibern. Sb., No. 3, 7–49 (1966).
G. Galperin and A. Zemlyakov, Mathematical Billiards [in Russian], Nauka, Moscow (1990).
A. Salomaa, Pearls of Formal Language Theory [Russian translation], Mir, Moscow (1986).
Author information
Authors and Affiliations
Additional information
__________
Translated from Kibernetika i Sistemnyi Analiz, No. 4, pp. 10–18, July–August 2007.
Rights and permissions
About this article
Cite this article
Rystsov, I.K. Minimal zero words for second-order matrices. Cybern Syst Anal 43, 478–483 (2007). https://doi.org/10.1007/s10559-007-0074-2
Received:
Issue Date:
DOI: https://doi.org/10.1007/s10559-007-0074-2