Automata on Gauss Words

DOI10.1007/978-3-642-00982-2_43MaRDI QIDQ3618609zbMATH OpenOpenAlexFDO

Authors Igor Potapov, Rafiq Saleh, Alexej P. Lisitsa

Publication date 2 April 2009

Published in Language and Automata Theory and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-00982-2_43

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Combinatorics on words (68R15)

Recommendations

• Planarity of Knots, Register Automata and LogSpace Computability
• An efficient algorithm to decide the knot problem
• The computational complexity of knot and link problems
• On the Length of Knot Transformations via Reidemeister Moves I and II
• THE PLANARITY PROBLEM II

Cites work

• Classifying Immersed Curves
• Finite state machines for strings over infinite alphabets
• Mathematical Foundations of Computer Science 2005
• On Notions of Regularity for Data Languages
• Temperley-Lieb Algebra: From Knot Theory to Logic and Computation via Quantum Mechanics
• The computational complexity of knot and link problems
• THE PLANARITY PROBLEM FOR SIGNED GAUSS WORDS
• THE PLANARITY PROBLEM II
• Typechecking for XML transformers
• Virtual knot theory

Cited in

(3)

• An efficient algorithm to decide the knot problem
• Counting Multiplicity over Infinite Alphabets
• Automaton mappings of words which multiply errors by a factor no greater than K in the Hamming and Levenshtein metrics

This page was built for publication: Automata on Gauss Words

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3618609)