Sciweavers

Share
IJAC
2011
8 years 7 months ago
The Subword Reversing Method
We summarize the main known results involving subword reversing, a method of semigroup theory for constructing van Kampen diagrams by referring to a preferred direction. In good ca...
Patrick Dehornoy
FLAIRS
2009
9 years 1 months ago
Automatic Text Categorization of Mathematical Word Problems
This paper describes a novel application of text categorization for mathematical word problems, namely Multiplicative Compare and Equal Group problems. The empirical results and a...
Suleyman Cetintas, Luo Si, Yan Ping Xin, Dake Zhan...
IJAC
2010
128views more  IJAC 2010»
9 years 2 months ago
Compressed Words and Automorphisms in Fully Residually Free Groups
We show that the compressed word problem in a finitely generated fully residually free group (F-group) is decidable in polynomial time, and use this result to show that the word ...
Jeremy MacDonald
CORR
2002
Springer
115views Education» more  CORR 2002»
9 years 3 months ago
Average-case complexity and decision problems in group theory
Abstract. We investigate the average-case complexity of decision problems for finitely generated groups, in particular the word and membership problems. Using our recent results on...
Ilya Kapovich, Alexei G. Myasnikov, Paul Schupp, V...
FUIN
2007
100views more  FUIN 2007»
9 years 3 months ago
An Algebraic Characterization of the Halting Probability
Using 1947 work of Post showing that the word problem for semigroups is unsolvable, we explicitly exhibit an algebraic characterization of the bits of the halting probability Ω....
Gregory J. Chaitin
DAM
2008
114views more  DAM 2008»
9 years 4 months ago
Efficient solutions to the braid isotopy problem
We describe the most efficient solutions to the word problem of Artin's braid group known so far, i.e., in other words, the most efficient solutions to the braid isotopy probl...
Patrick Dehornoy
MFCS
2005
Springer
9 years 9 months ago
Inverse Monoids: Decidability and Complexity of Algebraic Questions
This paper investigates the word problem for inverse monoids generated by a set Γ subject to relations of the form e = f, where e and f are both idempotents in the free inverse m...
Markus Lohrey, Nicole Ondrusch
books