"On the Complexity of the Smallest Grammar Problem over Fixed Alphabets."

Katrin Casel et al. (2021)

> Home

Details and statistics

DOI: 10.1007/S00224-020-10013-W

access: open

type: Journal Article

metadata version: 2023-03-21

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/mst/CaselFGGS21
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/mst/CaselFGGS21
Katrin Casel, Henning Fernau, Serge Gaspers, Benjamin Gras, Markus L. Schmid:
On the Complexity of the Smallest Grammar Problem over Fixed Alphabets. Theory Comput. Syst. 65(2): 344-409 (2021)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.