Skip to main content
SpringerLink
Log in

Periodic and Infinite Traces in Matrix Semigroups

  • Conference paper
SOFSEM 2008: Theory and Practice of Computer Science (SOFSEM 2008)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4910))

Abstract

In this paper we provide several new results concerning word and matrix semigroup problems using counter automaton models. As a main result, we prove a new version of Post’s correspondence problem to be undecidable and show its application to matrix semigroup problems, such as Any Diagonal Matrix Problem and Recurrent Matrix Problem. We also use infinite periodic traces in counter automaton models to show the undecidability of a new variation of the Infinite Post Correspondence Problem and Vector Ambiguity Problem for matrix semigroups.

This work was partially supported by Royal Society IJP 2007/R1 grant.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. Abdulla, P.A., Jonsson, B.: Undecidable Verification Problems for Programs with Unreliable Channels. Inf. Comput. 130(1), 71–90 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  2. Babai, L., Beals, R., Cai, J., Ivanyos, G., Luks, E.M.: Multiplicative Equations Over Commuting Matrices. In: ACM-SIAM Symposium on Discrete Algorithms, pp. 28–30 (1996)

    Google Scholar 

  3. Bell, P., Potapov, I.: Lowering Undecidability Bounds for Decision Questions in Matrices. In: Ibarra, O.H., Dang, Z. (eds.) DLT 2006. LNCS, vol. 4036, pp. 375–385. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  4. Bell, P., Potapov, I.: Reachability Problems in Quaternion Matrix and Rotation Semigroups. In: Kucera, L., Kucera, A. (eds.) MFCS 2007. LNCS, vol. 4708, Springer, Heidelberg (2007)

    Google Scholar 

  5. Blondel, V., Canterini, V.: Undecidable Problems for Probabilistic Automata of Fixed Dimensions. Theory Comput. Syst. 36(3), 231–245 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  6. Blondel, V., Cassaigne, J., Karhumäki, J.: Problem 10.3. In: Blondel, V., Megretski, A. (eds.) Freeness of Multiplicative Matrix Semigroups, Unsolved Problems in Mathematical Systems and Control Theory, pp. 309–314

    Google Scholar 

  7. Blondel, V., Cassaigne, J., Nichitiu, C.: On the Presence of Periodic Configurations in Turing Machines and in Counter Machines. Theoretical Computer Science 289, 573–590 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  8. Halava, V., Harju, T., Hirvensalo, M.: Undecidability Bounds for Integer Matrices using Claus Instances, TUCS Technical Report No. 766 (2006)

    Google Scholar 

  9. Halava, V., Harju, T.: Undecidability of Infinite Post Correspondence Problem for Instances of Size 9. Theoretical Informatics and Applications 40, 551–557 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  10. Korec, I.: Small Universal Register Machines. Theoretical Computer Science 168, 267–301 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  11. Kurganskyy, O., Potapov, I.: Computation in One-Dimensional Piecewise Maps and Planar Pseudo-Billiard Systems. Unconventional Computation, 169–175 (2005)

    Google Scholar 

  12. Lisitsa, A., Potapov, I.: In Time Alone: On the Computational Power of Querying the History. In: TIME 2006, pp. 42–49 (2006)

    Google Scholar 

  13. Matiyasevic, Y., Sénizergues, G.: Decision Problems for Semi-Thue Systems with a Few Rules. Theoretical Computer Science 330, 145–169 (2005)

    Article  MathSciNet  Google Scholar 

  14. Minsky, M.: Recursive Unsolvability of Post’s Problem of “tag” and other Topics in Theory of Turing Machines. Annals of Mathematics 74, 437–455 (1961)

    Article  MathSciNet  Google Scholar 

  15. Minsky, M.: Computation: Finite and Infinite Machines. Prentice-Hall International, Englewood Cliffs (1967)

    MATH  Google Scholar 

  16. Potapov, I.: From Post Systems to the Reachability Problems for Matrix Semigroups and Multicounter Automata. In: Calude, C.S., Calude, E., Dinneen, M.J. (eds.) DLT 2004. LNCS, vol. 3340, pp. 345–356. Springer, Heidelberg (2004)

    Google Scholar 

  17. Sipser, M.: Introduction to the Theory of Computation. PWS Publishing (1997)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, Turku University,  

    Paul Bell

  2. Department of Computer Science, University of Liverpool,  

    Igor Potapov

Authors
  1. Paul Bell
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Igor Potapov
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Viliam Geffert Juhani Karhumäki Alberto Bertoni Bart Preneel Pavol Návrat Mária Bieliková

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bell, P., Potapov, I. (2008). Periodic and Infinite Traces in Matrix Semigroups. In: Geffert, V., Karhumäki, J., Bertoni, A., Preneel, B., Návrat, P., Bieliková, M. (eds) SOFSEM 2008: Theory and Practice of Computer Science. SOFSEM 2008. Lecture Notes in Computer Science, vol 4910. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-77566-9_13

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-77566-9_13

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-77565-2

  • Online ISBN: 978-3-540-77566-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation