Publications (5)1.31 Total impact
 [Show abstract] [Hide abstract]
ABSTRACT: We examine questions involving nondeterministic finite automata where all states are final, initial, or both initial and final. First, we prove hardness results for the nonuniversality and inequivalence problems for these NFAs. Next, we characterize the languages accepted. Finally, we discuss some state complexity problems involving such automata.Theoretical Computer Science 08/2008; 410(4749410):50105021. DOI:10.1016/j.tcs.2009.07.049 · 0.66 Impact Factor  [Show abstract] [Hide abstract]
ABSTRACT: Carpi constructed an infinite word over a 4letter alphabet that avoids squares in all subsequences indexed by arithmetic progressions of odd difference. We show a connection between Carpi’s construction and the paperfolding words. We extend Carpi’s result by constructing uncountably many words that avoid squares in arithmetic progressions of odd difference. We also construct infinite words avoiding overlaps and infinite words avoiding all sufficiently large squares in arithmetic progressions of odd difference. We use these words to construct labelings of the 2dimensional integer lattice such that any line through the lattice encounters a squarefree (resp. overlapfree) sequence of labels.Theoretical Computer Science 02/2008; 391(12391):126137. DOI:10.1016/j.tcs.2007.10.039 · 0.66 Impact Factor 

Conference Paper: The Frobenius Problem in a Free Monoid.
[Show abstract] [Hide abstract]
ABSTRACT: The classical Frobenius problem over N is to compute the largest integer g not representable as a nonnegative integer linear combination of nonnegative integers x1; x2; : : : ; xk, where gcd(x1; x2; : : : ; xk) = 1. In this paper we consider novel generaliza tions of the Frobenius problem to the noncommutative setting of a free monoid. Unlike the commutative case, where the bound on g is quadratic, we are able to show exponential or subexponential behavior for several analogues of g, with the precise bound depending on the particular measure chosen.STACS 2008, 25th Annual Symposium on Theoretical Aspects of Computer Science, Bordeaux, France, February 2123, 2008, Proceedings; 01/2008  [Show abstract] [Hide abstract]
ABSTRACT: The classical Frobenius problem is to compute the largest number g not representable as a nonnegative integer linear combination of nonnegative integers x_1, x_2, ..., x_k, where gcd(x_1, x_2, ..., x_k) = 1. In this paper we consider generalizations of the Frobenius problem to the noncommutative setting of a free monoid. Unlike the commutative case, where the bound on g is quadratic, we are able to show exponential or subexponential behavior for an analogue of g, depending on the particular measure chosen.
Publication Stats
33  Citations  
1.31  Total Impact Points  
Top Journals
Institutions

2007–2008

University of Waterloo
 David R. Cheriton School of Computer Science
Waterloo, Ontario, Canada
