On the periods of partial words / Shur AM,Konovalova YV // . - 2001. - V. 2136, l. . - P. 657-665.

ISSN/EISSN:

0302-9743 / нет данных

Type:

Article; Proceedings Paper

Abstract:

In {[}1], partial words were defined to be partial mappings of a set. \{1,..., n\} to a finite alphabet. We continue the research of periodic partial words started in that paper. The main goal is to clarify the interaction of different periods of a word. In particular, we exhibit some propeties of periodic partial words, which axe quite similar to classical Theorem of Fine and Wilf.

Author keywords:

formal languages; combinatorics of words

DOI:

нет данных

Web of Science ID:

ISI:000179963500057

Соавторы в МНС:

—

Другие поля

Поле	Значение
Editor	Sgall, J and Pultr, A and Kolman, P
Booktitle	MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2001
Series	LECTURE NOTES IN COMPUTER SCIENCE
Note	26th International Symposium on Mathematical Foundations of Computer Science, MARIANSKE LAZNE, CZECH REPUBLIC, AUG 27-31, 2001
Organization	Acad Sci Czech Republic, Math Inst; Inst Theoret Comp Sci; Inst Comp Sci; Act M Agcy
Publisher	SPRINGER-VERLAG BERLIN
Address	HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
Language	English
ISBN	3-540-42496-2
Research-Areas	Computer Science; Mathematics
Web-of-Science-Categories	Computer Science, Theory \& Methods; Mathematics, Applied
Number-of-Cited-References	3
Doc-Delivery-Number	BV76K