@article{COLCOMBET200340,
    Abstract = {We study the partial algebra of typed terms with an associative commutative and idempotent operator (typed AC-terms). The originality lies in the representation of the typing policy by a graph which has a decidable monadic theory. In this paper we show on two examples that some results on AC-terms can be raised to the level of typed AC-terms. The examples are the results on rational languages (in particular their closure by complement) and the property reachability problem for ground rewrite systems (equivalently process rewrite systems).},
    Author = {Colcombet, Thomas},
    File = {Rewriting in the partial algebra of typed terms modulo AC - 1-s2.0-S1571066104805322-main - a.pdf},
    ISSN = {1571-0661},
    Journal = {Electronic Notes in Theoretical Computer Science},
    Note = {Infinity 2002, 4th International Workshop on Verification of Infinite-State Systems (CONCUR 2002 Satellite Workshop)},
    Number = {6},
    Pages = {40-54},
    Title = {Rewriting in the partial algebra of typed terms modulo AC},
    URL = {https://www.sciencedirect.com/science/article/pii/S1571066104805322},
    Volume = {68},
    Year = {2003},
    bdsk-url-1 = {https://www.sciencedirect.com/science/article/pii/S1571066104805322},
    bdsk-url-2 = {https://doi.org/10.1016/S1571-0661(04)80532-2},
    date-added = {2023-03-03 08:13:08 +0100},
    date-modified = {2023-03-03 08:13:08 +0100},
    doi = {10.1016/S1571-0661(04)80532-2}
}

@article{COLCOMBET200340, Abstract = {We study the partial algebra of typed terms with an associative commutative and idempotent operator (typed AC-terms). The originality lies in the representation of the typing policy by a graph which has a decidable monadic theory. In this paper we show on two examples that some results on AC-terms can be raised to the level of typed AC-terms. The examples are the results on rational languages (in particular their closure by complement) and the property reachability problem for ground rewrite systems (equivalently process rewrite systems).}, Author = {Colcombet, Thomas}, File = {Rewriting in the partial algebra of typed terms modulo AC - 1-s2.0-S1571066104805322-main - a.pdf}, ISSN = {1571-0661}, Journal = {Electronic Notes in Theoretical Computer Science}, Note = {Infinity 2002, 4th International Workshop on Verification of Infinite-State Systems (CONCUR 2002 Satellite Workshop)}, Number = {6}, Pages = {40-54}, Title = {Rewriting in the partial algebra of typed terms modulo AC}, URL = {https://www.sciencedirect.com/science/article/pii/S1571066104805322}, Volume = {68}, Year = {2003}, bdsk-url-1 = {https://www.sciencedirect.com/science/article/pii/S1571066104805322}, bdsk-url-2 = {https://doi.org/10.1016/S1571-0661(04)80532-2}, date-added = {2023-03-03 08:13:08 +0100}, date-modified = {2023-03-03 08:13:08 +0100}, doi = {10.1016/S1571-0661(04)80532-2} }