k-Universality of Regular Languages

A subsequence of a word w is a word u such that u=w[i1]w[i2]…w[ik], for some set of indices 1≤i1<i2<…<ik≤|w|. A word w is k-subsequence universal over an alphabet Σ if every word in Σk appears in w as a subsequence. In this paper, we study the intersection between the set of k-subsequence u...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Information and computation Ročník 307; s. 105357
Hlavní autori: Adamson, Duncan, Fleischmann, Pamela, Huch, Annika, Koß, Tore, Manea, Florin, Nowotka, Dirk
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Elsevier Inc 01.11.2025
Predmet:
Finite automata
Regular languages
String algorithms
Subsequences
String algorithms
Subsequences
Regular languages
Finite automata
ISSN:0890-5401
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:A subsequence of a word w is a word u such that u=w[i1]w[i2]…w[ik], for some set of indices 1≤i1<i2<…<ik≤|w|. A word w is k-subsequence universal over an alphabet Σ if every word in Σk appears in w as a subsequence. In this paper, we study the intersection between the set of k-subsequence universal words over some alphabet Σ and regular languages over Σ. We call a regular language L k-∃-subsequence universal if there exists a k-subsequence universal word in L, and k-∀-subsequence universal if every word of L is k-subsequence universal. We give algorithms solving the problems of deciding if a given regular language, represented by a finite automaton recognising it, is k-∃-subsequence universal and, respectively, if it is k-∀-subsequence universal, for a given k. The algorithms are FPT w.r.t. the size of the input alphabet, and their run-time does not depend on k; they run in polynomial time in the number n of states of the input automaton when the size of the input alphabet is O(log⁡n). Moreover, we show that the problem of deciding if a given regular language is k-∃-subsequence universal is NP-complete, when the language is over a large alphabet. Further, we provide algorithms for counting the number of k-subsequence universal words (paths) accepted by a given deterministic (respectively, non-deterministic) finite automaton, and ranking an input word (path) within the set of k-subsequence universal words accepted by a given finite automaton.
ISSN:0890-5401
DOI:10.1016/j.ic.2025.105357