Interaction properties of relational periods

Automata, Logic and Semantics We consider relational periods where the relation is a compatibility relation on words induced by a relation on letters. We introduce three types of periods, namely global, external and local relational periods, and we compare their properties by proving variants of the...

Full description

Saved in:
Bibliographic Details
Published in:Discrete mathematics and theoretical computer science 2008-01, Vol.10 no. 1 (Automata, Logic and Semantics), p.87-111
Main Authors: Halava, Vesa, Harju, Tero, Kärki, Tomi
Format: Article
Language:English
Subjects:
[info.info-dm] computer science [cs]/discrete mathematics [cs.dm]
Computer Science
Discrete Mathematics
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Automata, Logic and Semantics We consider relational periods where the relation is a compatibility relation on words induced by a relation on letters. We introduce three types of periods, namely global, external and local relational periods, and we compare their properties by proving variants of the theorem of Fine and Wilf for these periods.
ISSN:1365-8050
1462-7264
1365-8050
DOI:10.46298/dmtcs.419