Published in: LIPIcs, Volume 168, 47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)
Michaël Cadilhac, Filip Mazowiecki, Charles Paperman, Michał Pilipczuk, and Géraud Sénizergues. On Polynomial Recursive Sequences. In 47th International Colloquium on Automata, Languages, and Programming (ICALP 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 168, pp. 117:1-117:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{cadilhac_et_al:LIPIcs.ICALP.2020.117, author = {Cadilhac, Micha\"{e}l and Mazowiecki, Filip and Paperman, Charles and Pilipczuk, Micha{\l} and S\'{e}nizergues, G\'{e}raud}, title = {{On Polynomial Recursive Sequences}}, booktitle = {47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)}, pages = {117:1--117:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-138-2}, ISSN = {1868-8969}, year = {2020}, volume = {168}, editor = {Czumaj, Artur and Dawar, Anuj and Merelli, Emanuela}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2020.117}, URN = {urn:nbn:de:0030-drops-125240}, doi = {10.4230/LIPIcs.ICALP.2020.117}, annote = {Keywords: recursive sequences, expressive power, weighted automata, higher-order pushdown automata} }
Published in: LIPIcs, Volume 107, 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)
Géraud Sénizergues and Armin Weiß. The Isomorphism Problem for Finite Extensions of Free Groups Is In PSPACE. In 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 107, pp. 139:1-139:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{senizergues_et_al:LIPIcs.ICALP.2018.139, author = {S\'{e}nizergues, G\'{e}raud and Wei{\ss}, Armin}, title = {{The Isomorphism Problem for Finite Extensions of Free Groups Is In PSPACE}}, booktitle = {45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)}, pages = {139:1--139:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-076-7}, ISSN = {1868-8969}, year = {2018}, volume = {107}, editor = {Chatzigiannakis, Ioannis and Kaklamanis, Christos and Marx, D\'{a}niel and Sannella, Donald}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2018.139}, URN = {urn:nbn:de:0030-drops-91437}, doi = {10.4230/LIPIcs.ICALP.2018.139}, annote = {Keywords: virtually free groups, context-free groups, isomorphism problem, structure tree, graph of groups} }
Published in: LIPIcs, Volume 6, Proceedings of the 21st International Conference on Rewriting Techniques and Applications (2010)
Irène Durand, Géraud Sénizergues, and Marc Sylvestre. Termination of linear bounded term rewriting systems. In Proceedings of the 21st International Conference on Rewriting Techniques and Applications. Leibniz International Proceedings in Informatics (LIPIcs), Volume 6, pp. 341-356, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2010)
@InProceedings{durand_et_al:LIPIcs.RTA.2010.341, author = {Durand, Ir\`{e}ne and S\'{e}nizergues, G\'{e}raud and Sylvestre, Marc}, title = {{Termination of linear bounded term rewriting systems}}, booktitle = {Proceedings of the 21st International Conference on Rewriting Techniques and Applications}, pages = {341--356}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-18-7}, ISSN = {1868-8969}, year = {2010}, volume = {6}, editor = {Lynch, Christopher}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.RTA.2010.341}, URN = {urn:nbn:de:0030-drops-26625}, doi = {10.4230/LIPIcs.RTA.2010.341}, annote = {Keywords: Term rewriting, termination, rewriting strategy} }