Automata on Gauss Words

DOI10.1007/978-3-642-00982-2_43zbMath1234.68225OpenAlexW1573842663MaRDI QIDQ3618609

Rafiq Saleh, Igor Potapov, 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

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

Related Items (1)

Counting Multiplicity over Infinite Alphabets

Cites Work

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

This page was built for publication: Automata on Gauss Words