Skip to main content
SpringerLink
Log in
Book cover

International Conference on Language and Automata Theory and Applications

LATA 2011: Language and Automata Theory and Applications pp 366–377Cite as

Planarity of Knots, Register Automata and LogSpace Computability

  • Conference paper

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

Abstract

In this paper we investigate the complexity of planarity of knot diagrams encoded by Gauss words, both in terms of recognition by automata over infinite alphabets and in terms of classical logarithmic space complexity. As the main result, we show that recognition of planarity of unsigned Gauss words can be done in deterministic logarithmic space and by deterministic register automata. We also demonstrate generic results on the mutual simulations between logspace bounded classical computations (over finite alphabets) and register automata working over infinite alphabets.

This is a preview of subscription content, 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Abramsky, S.: Temperley-Lieb Algebra: From Knot Theory to Logic and Computation via Quantum Mechanics. Mathematics of Quantum Computation and Quantum Technology (2007)

    Google Scholar 

  2. Björklund, H., Schwentick, T.: On Notions of Regularity for Data Languages. In: Csuhaj-Varjú, E., Ésik, Z. (eds.) FCT 2007. LNCS, vol. 4639, pp. 88–99. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  3. Cairns, G., Elton, D.: The planarity problem for signed Gauss words. Journal of Knot Theory and its Ramifications 2(4), 359–367 (1993)

    Article  MathSciNet  MATH  Google Scholar 

  4. Cairns, G., Elton, D.: The Planarity Problem II. Journal of Knot Theory and its Ramifications 5, 137–144 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  5. De Fraysseix, H., Ossona de Mendez, P.: On a characterization of Gauss codes. Discrete and Computational Geometry 22(2), 287–295 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  6. Dehn, M.: Uber kombinatorische topologie. Acta Math. 67, 123–168 (1936)

    Article  MathSciNet  MATH  Google Scholar 

  7. Freivalds, R.: Knot Theory, Jones Polynomial and Quantum Computing. In: Jedrzejowicz, J., Szepietowski, A. (eds.) MFCS 2005. LNCS, vol. 3618, pp. 15–25. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  8. Gauss, C.: Werke. Band 8. Teubner (1900)

    Google Scholar 

  9. Hass, J., Lagarias, J., Pippenger, N.: The computational complexity of knot and link problems. Journal of the ACM (JACM) 46(2), 185–211 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  10. Kaminski, M., Francez, N.: Finite-memory automata. Theoretical Computer Science 134(2), 329–363 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  11. Kari, J., Niemi, V.: Morphic Images of Gauss Codes. In: Developments in Language Theory, pp. 144–156 (1993)

    Google Scholar 

  12. Kauffman, L.: Virtual knot theory. Arxiv Preprint Math. GT/ 9811028 (1998)

    Google Scholar 

  13. Kurlin, V.: Gauss paragraphs of classical links and a characterization of virtual link groups. Mathematical Proceedings Cambridge Phil. Soc. 145, 129–140 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  14. Lewis, H., Papadimitriou, C.: Symmertric space-bounded computation (extended abstract). In: de Bakker, J.W., van Leeuwen, J. (eds.) ICALP 1980. LNCS, vol. 85, pp. 374–384. Springer, Heidelberg (1980)

    Chapter  Google Scholar 

  15. Lisitsa, A., Potapov, I., Saleh, R.: Automata on Gauss Words. In: Dediu, A.H., Ionescu, A.M., Martín-Vide, C. (eds.) LATA 2009. LNCS, vol. 5457, pp. 505–517. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  16. Lomonaco Jr., S., Kauffman, L.: Topological Quantum Computing and the Jones Polynomial. Arxiv Preprint Quant-ph/ 0605004 (2006)

    Google Scholar 

  17. Lovász, L., Marx, M.: A forbidden substructure characterization of Gauss codes. Bull. Amer. Math. Soc. 82(1) (1976)

    Google Scholar 

  18. Manturov, V.: A proof of Vassiliev’s conjecture on the planarity of singular links. Izvestiya: Mathematics 69(5), 1025–1033 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  19. Minsky, M.: Computation: finite and infinite machines (1967)

    Google Scholar 

  20. Nagy, J.: Über ein topologisches Problem von Gauss. Mathematische Zeitschrift 26(1), 579–592 (1927)

    Article  MathSciNet  MATH  Google Scholar 

  21. Neven, F., Schwentick, T., Vianu, V.: Finite state machines for strings over infinite alphabets. ACM Transactions on Computational Logic 5(3), 403–435 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  22. Read, R., Rosenstiehl, P.: On the Gauss crossing problem. Colloq. Math. Soc. Janos Bolyai. 18, 843–876 (1976)

    MathSciNet  MATH  Google Scholar 

  23. Reingold, O.: Undirected connectivity in log-space. Journal of the ACM (JACM) 55(4), 17 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  24. Rosenstiehl, P.: Solution algebrique du probleme de Gauss sur la permutation des points d’intersection d’une ou plusieurs courbes fermees du plan. CR Acad. Sci. Paris Ser. AB 283 (1976)

    Google Scholar 

  25. Rosenstiehl, P., Tarjan, R.: Gauss codes, planar Hamiltonian graphs, and stack-sortable permutations. Journal of Algorithms 5(3), 375–390 (1984)

    Article  MathSciNet  MATH  Google Scholar 

  26. Shtylla, B., Traldi, L., Zulli, L.: On the realization of double occurrence words. Discrete Mathematics 309(6), 1769–1773 (2009)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Liverpool, Ashton Building, Ashton St, Liverpool, L69 3BX, UK

    Alexei Lisitsa, Igor Potapov & Rafiq Saleh

Authors
  1. Alexei Lisitsa
    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

  3. Rafiq Saleh
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Research Group on Mathematical Linguistics, Universitat Rovira i Virgili, Avinguda Catalunya, 35, 43002, Tarragona, Spain

    Adrian-Horia Dediu  & Carlos Martín-Vide  & 

  2. Department of Informatics, Kyushu University, 744 Motooka, 819–0395, Fukuoka, Japan

    Shunsuke Inenaga

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lisitsa, A., Potapov, I., Saleh, R. (2011). Planarity of Knots, Register Automata and LogSpace Computability. In: Dediu, AH., Inenaga, S., Martín-Vide, C. (eds) Language and Automata Theory and Applications. LATA 2011. Lecture Notes in Computer Science, vol 6638. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-21254-3_29

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-21254-3_29

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-21253-6

  • Online ISBN: 978-3-642-21254-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation