Skip to main content
SpringerLink
Log in

Decision Questions on Integer Matrices

  • Conference paper
  • First Online:
Developments in Language Theory (DLT 2001)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2295))

Included in the following conference series:

Abstract

We give a survey of simple undecidability results and open problems concerning matrices of low order with integer entries. Connections to the theory of finite automata (with multiplicities) are also provided.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Albert, M. H., Lawrence, J.: A proof of Ehrenfeucht’s Conjecture. Theoret. Comput. Sci. 41 (1985) 121–123.

    Article  MATH  MathSciNet  Google Scholar 

  2. Berstel, J., Mignotte, M.: Deux propriétés décidables des suites récurrentes linéaires. Bull. Soc. Math. France 104 (1976) 175–184.

    MATH  MathSciNet  Google Scholar 

  3. Berstel, J., Reutenauer, C.: “Rational Series and Their Languages”, Springer-Verlag, 1988.

    Google Scholar 

  4. Blondel, V. D., Tsitsiklis, J. N.: When is a pair of matrices mortal. Inf. Proc. Letter 63 (1997) 283–286.

    Google Scholar 

  5. Cassaigne, J., Karhumäki, J.: Examples of undecidable problems for 2-generator matrix semigroups. Theoret. Comput. Sci. 204 (1998) 29–34.

    Article  MATH  MathSciNet  Google Scholar 

  6. Cassaigne, J., Harju, T., Karhumäki, J.: On the undecidability of freeness of matrix semigroups. Int. J. Algebra Comput. 9 (1999) 295–305.

    Article  MATH  Google Scholar 

  7. Claus, V.: Some remarks on PCP(k) and related problems. Bull. EATCS 12 (1980) 54–61.

    Google Scholar 

  8. Claus, V.: The (n,k)-bounded emptiness-problem for probabilistic acceptors and related problems. Acta Inform. 16 (1981) 139–160.

    Article  MATH  MathSciNet  Google Scholar 

  9. Eilenberg, S.: “Automata, Languages, and Machines”, Vol A, Academic Press, New York, 1974.

    MATH  Google Scholar 

  10. Guba, V. S.: The equivalence of infinite systems of equations in free groups and semigroups with finite subsystems. Mat. Zametki 40 (1986) 321–324 (in Russian).

    MATH  MathSciNet  Google Scholar 

  11. Halava, V.: “Decidable and Undecidable Problems in Matrix Theory”, Master’s Thesis, University of Turku, 1997.

    Google Scholar 

  12. Halava, V., Harju, T.: Mortality in matrix semigroups. Amer. Math. Monthly 108 (2001) 649–653.

    Article  MATH  MathSciNet  Google Scholar 

  13. Hansel, G.: Une démonstration simple du théorème de Skolem-Mahler-Lech. Theoret. Comput. Sci. 43 (1986) 1–10.

    Article  MathSciNet  Google Scholar 

  14. Harju, T., Karhumäki, J.: The equivalence problem of multitape automata. Theoret. Comput. Sci. 78 (1991) 347–355.

    Article  MATH  MathSciNet  Google Scholar 

  15. Harju, T., Karhumäki, J.: Morphisms. In Handbook of Formal Languages,Vol. 1, (A. Salomaa and G. Rozenberg, eds), Springer-Verlag, 1997, pp. 439–510.

    Google Scholar 

  16. Harju, T., Karhumäki, J., Plandowski, W.: Independent system of equations, in M. Lothaire, Algebraic Combinatorics on Words, Cambridge University Press, to appear.

    Google Scholar 

  17. Jacob, G.: La finitude des reprèsentations linéaires de semi-groupes est décidable. J. Algebra 52 (1978) 437–459.

    Article  MATH  MathSciNet  Google Scholar 

  18. Klarner, D. A., Birget, J.-C., Satterfield, W.: On the undecidability of the freeness of integer matrix semigroups. Int. J. Algebra Comp. 1 (1991) 223–226.

    Article  MATH  MathSciNet  Google Scholar 

  19. Krom, M.:An unsolvable problem with products of matrices. Math. System. Theory 14 (1981) 335–337.

    Google Scholar 

  20. Mandel, A., Simon, I.: On finite semigroups of matrices. Theoret. Comput. Sci. 5 (1977) 101–111.

    Article  MathSciNet  Google Scholar 

  21. Manna, Z.: “Mathematical Theory of Computations”, McGraw-Hill, 1974.

    Google Scholar 

  22. Markov, A. A.: On certain insoluble problems concerning matrices. Doklady Akad. Nauk SSSR (N.S.) 57 (1947) 539–542 (in Russian).

    MATH  MathSciNet  Google Scholar 

  23. Markov, A. A.: On the problem of representability of matrices. Z. Math. Logik Grundlagen Math. 4 (1958) 157–168 (in Russian).

    Article  MATH  MathSciNet  Google Scholar 

  24. Matiyasevich, Y., Sénizergues, G.: Decision problems for semi-Thue systems with a fewrules. In Proceedings of the 11th IEEE Symposium on Logic in Computer Science, pages 523–531, 1996.

    Google Scholar 

  25. Miller III, C. F.: “On Group Theoretic Decision Problems and Their Classification”, Annals of Math. Study 68, Princeton Univ. Press 1971.

    Google Scholar 

  26. Miller III, C. F.: Decision problems for groups-Survey and reflections, in “Algorithms and Classification in Combinatorial Group Theory” (G. Baumslag and C. F. Miller III, eds.), Springer-Verlag, 1992, 1–59.

    Google Scholar 

  27. Nielsen, J.: Die Gruppe der dreidimensionalen Gittertransformationen. Danske Vid. Selsk. Math.-Fys. Medd. V 12 (1924) 1–29.

    Google Scholar 

  28. Paterson, M. S.: Unsolvability in 3×3-matrices. Studies in Appl. Math. 49 (1970) 105–107.

    MathSciNet  MATH  Google Scholar 

  29. Post, E.:A variant of a recursively unsolvable problem. Bulletin of Amer. Math. Soc. 52 (1946) 264–268.

    Google Scholar 

  30. Schultz, P.: Mortality of 2 × 2-matrices. Amer. Math. Monthly 84 (1977) 463–464.

    Article  MATH  MathSciNet  Google Scholar 

  31. Schupp, P. E.: Embeddings into simple groups. J. London Math. Soc. 13 (1976) 90–94.

    Article  MATH  MathSciNet  Google Scholar 

  32. Turakainen, P.: On multistochastic automata. Inform. Control 23 (1973) 183–203.

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, University of Turku, FIN-20014, Turku, Finland

    Tero Harju

Authors
  1. Tero Harju
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institut für Algebra und Computermathematik Abt. für Theoretische Informatik, Technische Universität Wien, Wiedner Hauptstraße 8-10, 1040, Wien, Austria

    Werner Kuich

  2. Department of Computer Science, Leiden University, P.O. Box 9512, 2300, RA Leiden, The Netherlands

    Grzegorz Rozenberg

  3. Turku Centre for Computer Science, Lemminkaisenkatu 14A, 20520, Turku, Finland

    Arto Salomaa

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Harju, T. (2002). Decision Questions on Integer Matrices. In: Kuich, W., Rozenberg, G., Salomaa, A. (eds) Developments in Language Theory. DLT 2001. Lecture Notes in Computer Science, vol 2295. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46011-X_5

Download citation

  • DOI: https://doi.org/10.1007/3-540-46011-X_5

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-43453-5

  • Online ISBN: 978-3-540-46011-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation