Abstract

Partial words are sequences over a finite alphabet that may contain wildcard symbols, called holes, which match or are compatible with all letters; partial words without holes are said to be full words (or simply words). Given an infinite partial word w, the number of distinct full words over the alphabet that are compatible with factors of w of length n… (More)
DOI: 10.4204/EPTCS.63.11

Topics

  • Presentations referencing similar topics