Published in: LIPIcs, Volume 226, 11th International Conference on Fun with Algorithms (FUN 2022)
Miguel Ambrona. A Practical Algorithm for Chess Unwinnability. In 11th International Conference on Fun with Algorithms (FUN 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 226, pp. 2:1-2:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{ambrona:LIPIcs.FUN.2022.2, author = {Ambrona, Miguel}, title = {{A Practical Algorithm for Chess Unwinnability}}, booktitle = {11th International Conference on Fun with Algorithms (FUN 2022)}, pages = {2:1--2:20}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-232-7}, ISSN = {1868-8969}, year = {2022}, volume = {226}, editor = {Fraigniaud, Pierre and Uno, Yushi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2022.2}, URN = {urn:nbn:de:0030-drops-159721}, doi = {10.4230/LIPIcs.FUN.2022.2}, annote = {Keywords: chess, helpmate, unwinnability, timeout, dead position} }
Published in: LIPIcs, Volume 170, 45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020)
Pierre Ganty, Elena Gutiérrez, and Pedro Valero. A Quasiorder-Based Perspective on Residual Automata. In 45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 170, pp. 40:1-40:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{ganty_et_al:LIPIcs.MFCS.2020.40, author = {Ganty, Pierre and Guti\'{e}rrez, Elena and Valero, Pedro}, title = {{A Quasiorder-Based Perspective on Residual Automata}}, booktitle = {45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020)}, pages = {40:1--40:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-159-7}, ISSN = {1868-8969}, year = {2020}, volume = {170}, editor = {Esparza, Javier and Kr\'{a}l', Daniel}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2020.40}, URN = {urn:nbn:de:0030-drops-127071}, doi = {10.4230/LIPIcs.MFCS.2020.40}, annote = {Keywords: Residual Automata, Quasiorders, Double-Reversal Method, Canonical RFA, Regular Languages} }
Published in: LIPIcs, Volume 138, 44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019)
Pierre Ganty, Elena Gutiérrez, and Pedro Valero. A Congruence-based Perspective on Automata Minimization Algorithms. In 44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 138, pp. 77:1-77:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{ganty_et_al:LIPIcs.MFCS.2019.77, author = {Ganty, Pierre and Guti\'{e}rrez, Elena and Valero, Pedro}, title = {{A Congruence-based Perspective on Automata Minimization Algorithms}}, booktitle = {44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019)}, pages = {77:1--77:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-117-7}, ISSN = {1868-8969}, year = {2019}, volume = {138}, editor = {Rossmanith, Peter and Heggernes, Pinar and Katoen, Joost-Pieter}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2019.77}, URN = {urn:nbn:de:0030-drops-110214}, doi = {10.4230/LIPIcs.MFCS.2019.77}, annote = {Keywords: Double-Reversal Method, Minimization, Automata, Congruences, Regular Languages} }
Published in: LIPIcs, Volume 122, 38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2018)
Pierre Ganty and Elena Gutiérrez. The Parikh Property for Weighted Context-Free Grammars. In 38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 122, pp. 32:1-32:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{ganty_et_al:LIPIcs.FSTTCS.2018.32, author = {Ganty, Pierre and Guti\'{e}rrez, Elena}, title = {{The Parikh Property for Weighted Context-Free Grammars}}, booktitle = {38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2018)}, pages = {32:1--32:20}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-093-4}, ISSN = {1868-8969}, year = {2018}, volume = {122}, editor = {Ganguly, Sumit and Pandya, Paritosh}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2018.32}, URN = {urn:nbn:de:0030-drops-99315}, doi = {10.4230/LIPIcs.FSTTCS.2018.32}, annote = {Keywords: Weighted Context-Free Grammars, Algebraic Language Theory, Parikh Image} }
Feedback for Dagstuhl Publishing