Partial words and a theorem of Fine and Wilf

被引：118

作者：

Berstel, J

Boasson, L

机构：

[1] Univ Denis Diderot, Lab Informat Algorithm Fondaments & Applicat, F-75251 Paris 05, France

[2] Univ Marne La Vallee, Inst Gaspard Monge, Marne La Vallee 77 2, France

来源：

THEORETICAL COMPUTER SCIENCE | 1999年 / 218卷 / 01期

关键词：

combinatorial problems; words; formal languages;

D O I：

10.1016/S0304-3975(98)00255-2

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

A partial word is a word that is a partial mapping into an alphabet. We prove a variant of Fine and Wilf's theorem for partial words, and give extensions of some general combinatorial properties of words. (C) 1999 Elsevier Science B.V. All rights reserved.

引用

页码：135 / 141

页数：7