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. © 2011 Springer-Verlag.
CITATION STYLE
Lisitsa, A., Potapov, I., & Saleh, R. (2011). Planarity of knots, register automata and logspace computability. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6638 LNCS, pp. 366–377). Springer Verlag. https://doi.org/10.1007/978-3-642-21254-3_29
Mendeley helps you to discover research relevant for your work.