Subsequence matching and analysis problems for automata with translucent letters

DOI10.1007/978-3-032-02602-6_11MaRDI QIDQ6861686zbMATH OpenFDO

Authors Szilárd Zsolt Fazekas, Béla Klein, Tore Koß, Florin Manea, Robert Mercaş, Timo Specht

Publication date 10 February 2026

Full work available at URL https://doi.org/10.1007/978-3-032-02602-6_11

zbMATH Keywords

automata with translucent letterssubsequenceuniversality

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites work

• \(k\)-universality of regular languages
• k-universality of regular languages revisited
• A survey on automata with translucent letters
• An algorithm for distinguishing efficiently bit-strings by their subsequences
• Combinatorial algorithms for subsequence matching: a survey
• Jump complexity of deterministic finite automata with translucent letters
• Jump complexity of finite automata with translucent letters
• Jumping finite automata
• One-way jumping finite automata
• Scattered Factor-Universality of Words

This page was built for publication: Subsequence matching and analysis problems for automata with translucent letters

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6861686)