Atlas home || Conferences | Abstracts | about Atlas

SCRA 2006-FIM XIII-Thirteenth International Conference of the Forum for Interdisciplinary Mathematics on Interdisciplinary Mathematical and Statistical Techniques
September 1-4, 2006
New University of Lisbon-Tomar Polytechnic Institute
Lisbon-Tomar, Portugal

Organizers
Sat Gupta, Carlos Coelho and Satya Mishra

View Abstracts
Conference Homepage

Counting Unbordered Partial Words
by
Joel Dodge
Hunter College / University of California San Diego
Coauthors: Francine Blanchet-Sadri, Margaret Moorefield, Jonathan Britton

An unbordered word is a string over a finite alphabet such that none of its proper prefixes is one of its suffixes. There is a simple formula for the number of unbordered words of a given length. In this talk, we will present some of the work that we have done in an attempt to find a formula for the number of unbordered partial words of a given length. Partial words are strings that may have a number of "do not know" symbols.

Date received: July 15, 2006

Copyright © 2006 by the author(s). The author(s) of this document and the organizers of the conference have granted their consent to include this abstract in Atlas Conferences Inc. Document # catj-18.