Sciweavers

20 search results - page 4 / 4
» ijac 2007
Sort
View
IJAC
2007
64views more  IJAC 2007»
14 years 10 months ago
Star-Free Geodesic Languages for Groups
In this article we show that every group with a finite presentation satisfying one or both of the small cancellation conditions C (1/6) and C (1/4) − T (4) has the property that...
Susan M. Hermiller, Derek F. Holt, Sarah Rees
IJAC
2010
231views more  IJAC 2010»
14 years 7 months ago
Descriptive Complexity of Finite Abelian Groups
Title of dissertation: MODEL THEORY AND COMPLEXITY THEORY Walid Gomaa Doctor of Philosophy, 2007 Dissertation directed by: Professor William Gasarch Department of Computer Science...
Walid Gomaa
IJAC
2007
59views more  IJAC 2007»
14 years 10 months ago
Automorphic Equivalence Problem for Free Associative Algebras of Rank Two
Let K x, y be the free associative algebra of rank 2 over an algebraically closed constructive field of any characteristic. We present an algorithm which decides whether or not tw...
Vesselin Drensky, Jie-Tai Yu
IJAC
2007
99views more  IJAC 2007»
14 years 10 months ago
Normalized Expressions and Finite Automata
There exist two well-known quotients of the position automaton of a regular expression. The first one, called the equation automaton, has first been introduced by Mirkin from th...
Jean-Marc Champarnaud, Faissal Ouardi, Djelloul Zi...
IJAC
2007
116views more  IJAC 2007»
14 years 10 months ago
On the Complexity of the Whitehead Minimization Problem
The Whitehead minimization problem consists in finding a minimum size element in the automorphic orbit of a word, a cyclic word or a finitely generated subgroup in a finite rank...
Abdó Roig, Enric Ventura, Pascal Weil