On the Membership of Invertible Diagonal Matrices
暂无分享,去创建一个
[1] Richard J. Lipton,et al. Polynomial-time algorithm for the orbit problem , 1986, JACM.
[2] Tero Harju,et al. Mortality in Matrix Semigroups , 2001, Am. Math. Mon..
[3] Moore,et al. Unpredictability and undecidability in dynamical systems. , 1990, Physical review letters.
[4] John N. Tsitsiklis,et al. A survey of computational complexity results in systems and control , 2000, Autom..
[5] M. Paterson. Unsolvability in 3 × 3 Matrices , 1970 .
[6] Igor Potapov,et al. Membership and Reachability Problems for Row-Monomial Transformations , 2004, MFCS.
[7] Igor Potapov. From Post Systems to the Reachability Problems for Matrix Semigroups and Multicounter Automata , 2004, Developments in Language Theory.
[8] Grzegorz Rozenberg,et al. Developments in Language Theory II , 2002 .
[9] Ronald L. Graham,et al. Concrete mathematics - a foundation for computer science , 1991 .
[10] Juhani Karhumäki,et al. Combinatorics on words: a tutorial , 2003, Bull. EATCS.
[11] Jan Kratochvíl,et al. Mathematical Foundations of Computer Science 2004 , 2004, Lecture Notes in Computer Science.