The theorem of Fine and Wilf for relational periods

We consider relational periods, where the relation is a compatibility relation on words induced by a relation on letters. We prove a variant of the theorem of Fine and Wilf for a (pure) period and a relational period.

Bibliographische Detailangaben

Veröffentlicht in:	RAIRO. Informatique théorique et applications 2009-04, Vol.43 (2), p.209-220
Hauptverfasser:	Halava, Vesa, Harju, Tero, Kärki, Tomi
Format:	Artikel
Sprache:	eng
Schlagworte:	68R15 Applied sciences compatibility Computer science control theory systems Exact sciences and technology Fine Miscellaneous partial word Period Theoretical computing Wilf
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!