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

zbMATH Keywords

universalitysubsequenceautomata with translucent letters

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

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)