Showing cs.FLShow all
2 papers · 1 filter
cs.FL2024
Subsequence Matching and Analysis Problems for Formal Languages
Szilárd Zsolt Fazekas, Tore Koß, Florin Manea +2
In this paper, we study a series of algorithmic problems related to the subsequences occurring in the strings of a given language, under the assumption that this language is succin…
cs.FL2023
Sweep Complexity Revisited
Szilárd Zsolt Fazekas, Robert Mercaş
We study the sweep complexity of DFA in one-way jumping mode answering several questions posed earlier. This measure is the number of times in the worst case that such machines hav…