Files in this item
k-universality of regular languages
Item metadata
dc.contributor.author | Adamson, Duncan | |
dc.contributor.author | Fleischmann, Pamela | |
dc.contributor.author | Huch, Annika | |
dc.contributor.author | Koß, Tore | |
dc.contributor.author | Manea, Florin | |
dc.contributor.author | Nowotka, Dirk | |
dc.contributor.editor | Iwata, Satoru | |
dc.contributor.editor | Kakimura, Naonori | |
dc.date.accessioned | 2024-06-05T16:30:03Z | |
dc.date.available | 2024-06-05T16:30:03Z | |
dc.date.issued | 2023-12 | |
dc.identifier | 302433007 | |
dc.identifier | 7212c49b-9d09-4466-a9e7-e24089d9a7f4 | |
dc.identifier | 85179139394 | |
dc.identifier.citation | Adamson , D , Fleischmann , P , Huch , A , Koß , T , Manea , F & Nowotka , D 2023 , k-universality of regular languages . in S Iwata & N Kakimura (eds) , 34th International Symposium on Algorithms and Computation, ISAAC 2023 . , 4 , Leibniz International Proceedings in Informatics, LIPIcs , vol. 283 , Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing , 34th International Symposium on Algorithms and Computation, ISAAC 2023 , Kyoto , Japan , 3/12/23 . https://doi.org/10.4230/LIPIcs.ISAAC.2023.4 | en |
dc.identifier.citation | conference | en |
dc.identifier.isbn | 9783959772891 | |
dc.identifier.issn | 1868-8969 | |
dc.identifier.other | ORCID: /0000-0003-3343-2435/work/160753718 | |
dc.identifier.uri | https://hdl.handle.net/10023/29996 | |
dc.description | Duncan Adamson’s work was funded by the Leverhulme Trust via the Leverhulme Research Centre for Functional Material Design. Tore Koß’s work was supported by the DFG project number 389613931. Florin Manea’s work was supported by the DFG Heisenberg-project number 466789228. | en |
dc.description.abstract | 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, nondeterministic) finite automaton, and ranking an input word (path) within the set of k-subsequence universal words accepted by a given finite automaton. | |
dc.format.extent | 900546 | |
dc.language.iso | eng | |
dc.publisher | Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing | |
dc.relation.ispartof | 34th International Symposium on Algorithms and Computation, ISAAC 2023 | en |
dc.relation.ispartofseries | Leibniz International Proceedings in Informatics, LIPIcs | en |
dc.subject | Finite Automata | en |
dc.subject | Regular Languages | en |
dc.subject | String Algorithms | en |
dc.subject | Subsequences | en |
dc.subject | Software | en |
dc.subject | T-NDAS | en |
dc.title | k-universality of regular languages | en |
dc.type | Conference item | en |
dc.contributor.institution | University of St Andrews. School of Computer Science | en |
dc.identifier.doi | 10.4230/LIPIcs.ISAAC.2023.4 |
This item appears in the following Collection(s)
Items in the St Andrews Research Repository are protected by copyright, with all rights reserved, unless otherwise indicated.