Intersection of finitely generated congruences over term algebra

Publisher： Elsevier

ISSN： 0304-3975

Source： Theoretical Computer Science, Vol.300, Iss.1, 2003-05, pp. : 209-234

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Gröbner Bases Applied to Finitely Generated Field Extensions

By Müller-Quade J. Steinwandt R.

Journal of Symbolic Computation, Vol. 30, Iss. 4, 2000-10 ,pp. : 469-490

Academic Press

Access to resources Recommend Favorite

Constructing Faithful Representations of Finitely-generated Torsion-free Nilpotent Groups

By de Graaf W.A. Nickel W.

Journal of Symbolic Computation, Vol. 33, Iss. 1, 2002-01 ,pp. : 31-41

Academic Press

Access to resources Recommend Favorite

On a question of A. Salomaa The equational theory of regular expressions over a singleton alphabet is not finitely based

By Aceto L. Fokkink W. Ingolfsdottir A.

Theoretical Computer Science, Vol. 209, Iss. 1, 1998-12 ,pp. : 163-178

Elsevier

Access to resources Recommend Favorite

Explicit substitutions for pi-congruences

By Quaglia P.

Theoretical Computer Science, Vol. 269, Iss. 1, 2001-10 ,pp. : 83-134

Elsevier

Access to resources Recommend Favorite

On syntactic congruences for -languages

By Maler O. Staiger L.

Theoretical Computer Science, Vol. 183, Iss. 1, 1997-08 ,pp. : 93-112

Elsevier

Access to resources Recommend Favorite