On the Complexity of the Smallest Grammar Problem over Fixed Alphabets
Crossref DOI link: https://doi.org/10.1007/s00224-020-10013-w
Published Online: 2020-11-13
Published Print: 2021-02
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Casel, Katrin
Fernau, Henning
Gaspers, Serge
Gras, Benjamin
Schmid, Markus L. http://orcid.org/0000-0001-5137-1504
Text and Data Mining valid from 2020-11-13
Version of Record valid from 2020-11-13
Article History
Accepted: 9 October 2020
First Online: 13 November 2020