1. Constant-Delay Enumeration for Nondeterministic Document Spanners
2. Constant-Delay Enumeration for Nondeterministic Document Spanners
3. K. Casel , H. Fernau , S. Gaspers , B. Gras , and M.L. Schmid . 2020. On the Complexity of the Smallest Grammar Problem over Fixed Alphabets. Theory of Computing Systems (2020). https://doi.org/10.1007/s00224-020--10013-w Conference version appeared in Proc . ICALP 2016 .. 10.1007/s00224-020--10013-w K. Casel, H. Fernau, S. Gaspers, B. Gras, and M.L. Schmid. 2020. On the Complexity of the Smallest Grammar Problem over Fixed Alphabets. Theory of Computing Systems (2020). https://doi.org/10.1007/s00224-020--10013-w Conference version appeared in Proc. ICALP 2016..
4. The Smallest Grammar Problem
5. Joel D. Day and Florin Manea. 2020. On the Structure of Solution Sets to Regular Word Equations. In 47th International Colloquium on Automata, Languages, and Programming, ICALP 2020, July 8--11, 2020, Saarbrücken, Germany (Virtual Conference). 124:1--124:16 . https://doi.org/10.4230/LIPIcs.ICALP. 2020 .124 10.4230/LIPIcs.ICALP.2020.124 Joel D. Day and Florin Manea. 2020. On the Structure of Solution Sets to Regular Word Equations. In 47th International Colloquium on Automata, Languages, and Programming, ICALP 2020, July 8--11, 2020, Saarbrücken, Germany (Virtual Conference). 124:1--124:16. https://doi.org/10.4230/LIPIcs.ICALP.2020.124