Subsequence matching and analysis problems for automata with translucent letters

In this paper, we settle a series of algorithmic problems related to the (sets of) subsequences occurring in the strings of a given formal language, represented by a deterministic finite automaton with translucent letters accepting it, which were left open in [Fazekas et al., ISAAC 2024]. Firstly, w...

Full description

Saved in:
Bibliographic Details
Main Authors: Szilárd Zsolt Fazekas, Béla Klein, Tore Koß, Florin Manea, Robert Mercas, Timo Specht
Format: Default Conference proceeding
Published: 2025
Subjects:
Information and computing sciences
Artificial Intelligence & Image Processing
Subsequence
Universality
Automata with translucent letters
Online Access:https://hdl.handle.net/2134/30264325.v1
Tags: Add Tag
No Tags, Be the first to tag this record!

Similar Items