CONSTRUCTING THE MAXIMUM PREFIX-CLOSED SUBSET FOR A SET OF -[omega]-WORDS DEFINED BY A - [omega]-REGULAR EXPRESSION

CONSTRUCTING THE MAXIMUM PREFIX-CLOSED SUBSET FOR A SET OF -[omega]-WORDS DEFINED BY A - [omega]-REGULAR EXPRESSION

In this paper, we present a method of constructing the maximum prefix-closed subset of a set of - [omega]-words R defined by a - [omega]-regular expression. This method is based on constructing a labeled graph called a graph of elementary extensions whose vertices are some - [omega]-regular subsets...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Cybernetics and systems analysis 2023-11, Vol.59 (6), p.880
1. Verfasser: Chebotarev, A.N
Format: Artikel
Sprache:eng
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:In this paper, we present a method of constructing the maximum prefix-closed subset of a set of - [omega]-words R defined by a - [omega]-regular expression. This method is based on constructing a labeled graph called a graph of elementary extensions whose vertices are some - [omega]-regular subsets of the set R. With every graph vertex, we associate a linear equation over sets of - [omega]-words.
ISSN:1060-0396
DOI:10.1007/s10559-023-00623-w