The computational complexity of knot and link problems
Journal of the ACM (JACM)
Typechecking for XML transformers
Journal of Computer and System Sciences - Special issue on PODS 2000
Finite state machines for strings over infinite alphabets
ACM Transactions on Computational Logic (TOCL)
LTL with the Freeze Quantifier and Register Automata
LICS '06 Proceedings of the 21st Annual IEEE Symposium on Logic in Computer Science
SFCS '90 Proceedings of the 31st Annual Symposium on Foundations of Computer Science
Knot theory, jones polynomial and quantum computing
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
On notions of regularity for data languages
FCT'07 Proceedings of the 16th international conference on Fundamentals of Computation Theory
Counting Multiplicity over Infinite Alphabets
RP '09 Proceedings of the 3rd International Workshop on Reachability Problems
Planarity of knots, register automata and logspace computability
LATA'11 Proceedings of the 5th international conference on Language and automata theory and applications
| Hi-index | 0.01 |
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.