Subsequence matching and analysis problems for formal languages.
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 succinctly represented by a grammar generating it, or an automaton accepting it. In particular, we focus on the following prob...
Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Default Conference proceeding |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://hdl.handle.net/2134/29625620.v1 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|