A complexity approach to tree algebras: the polynomial case

DOI10.4230/LIPICS.MFCS.2022.37MaRDI QIDQ6584034zbMATH OpenFDO

Authors Thomas Colcombet, Arthur Jaquard

Publication date 6 August 2024

Full work available at URL https://doi.org/10.4230/LIPICS.MFCS.2022.37

zbMATH Keywords

language theorynominal automatatree algebra

Mathematics Subject Classification ID

Theory of computing (68Qxx)

This page was built for publication: A complexity approach to tree algebras: the polynomial case

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6584034)