State complexity of the minimal star basis

DOI10.1016/J.TCS.2026.115892MaRDI QIDQ7229634zbMATH OpenFDO

Authors Jozef jun. Jirásek, Galina Jirásková, Jeffrey Shallit

Publication date 16 April 2026

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.TCS.2026.115892

zbMATH Keywords

minimal star basisregular languagesstate complexity

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• Fast Pattern Matching in Strings
• scientific article; zbMATH DE number 3353192 (Why is no real title available?)
• Inverse star, borders, and palstars
• The state complexities of some basic operations on regular languages

This page was built for publication: State complexity of the minimal star basis

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