Automata on Gauss Words

In this paper we investigate the computational complexity of knot theoretic problems and show upper and lower bounds for planarity problem of signed and unsigned knot diagrams represented by Gauss words. Due to the fact the number of crossing in knots is unbounded, the Gauss words of knot diagrams are strings over infinite (unbounded) alphabet. For establishing the lower and upper bounds on recognition of knot properties we study these problems in a context of automata models over infinite alphabet.

• Type: Conference
• Year: 2009
• Where: LATA
• Authors: Alexei Lisitsa, Igor Potapov, Rafiq Saleh
• Keywords: Automata Theory, Gauss Words, Knot Diagrams, Knot Theoretic Problems, LATA 2009