New means of cybernetics, informatics, computer engineering, and systems analysis

The class of combinatorial problems equivalent to the problem of determination of relative positions of n interval sequences is formulated. It is shown that an adequate mathematical model of solving a stated problem is a finite dynamic memoryless automaton and that the adequate mathematical apparatu...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Cybernetics and systems analysis 2009-05, Vol.45 (3), p.489-496
1. Verfasser: Levin, V I
Format: Artikel
Sprache:eng
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:The class of combinatorial problems equivalent to the problem of determination of relative positions of n interval sequences is formulated. It is shown that an adequate mathematical model of solving a stated problem is a finite dynamic memoryless automaton and that the adequate mathematical apparatus is continuous logic. Algorithms that solve the problem are constructed.
ISSN:1060-0396
DOI:10.1007/s10559-009-9107-3