On Descriptional Complexity of the Planarity Problem for Gauss Words

Details On Descriptional Complexity of the Planarity Problem for Gauss Words On Descriptional Complexity of the Planarity Problem for Gauss Words

2009-07-24

arxiv.org/abs/0907.4180v1

Computer Science

Formal Languages and Automata Theory

Scientific paper

In this paper we investigate the descriptional complexity of knot theoretic problems and show upper bounds for planarity problem of signed and unsigned knot diagrams represented by Gauss words. Since a topological equivalence of knots can involve knot diagrams with arbitrarily many crossings then Gauss words will be considered as strings over an infinite (unbounded) alphabet. For establishing the upper bounds on recognition of knot properties, we study these problems in a context of automata models over an infinite alphabet.

Affiliated with

Also associated with

No associations

Rating

On Descriptional Complexity of the Planarity Problem for Gauss Words does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On Descriptional Complexity of the Planarity Problem for Gauss Words, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On Descriptional Complexity of the Planarity Problem for Gauss Words will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-308690