Termination modulo equations by abstract commutation with an application to iteration

Publisher： Elsevier

ISSN： 0304-3975

Source： Theoretical Computer Science, Vol.177, Iss.2, 1997-05, pp. : 407-423

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

On the Complexity of Deduction Modulo Leaf Permutative Equations

By Boy de la Tour Thierry Echenim Mnacho

Journal of Automated Reasoning, Vol. 33, Iss. 3-4, 2004-10 ,pp. : 271-317

Springer Publishing Company

Access to resources Recommend Favorite

Normalized Rewriting: an Alternative to Rewriting modulo a Set of Equations

By Marche C.

Journal of Symbolic Computation, Vol. 21, Iss. 3, 1996-03 ,pp. : 253-288

Academic Press

Access to resources Recommend Favorite

Solving word equations modulo partial commutations

By Diekert V. Matiyasevich Y. Muscholl A.

Theoretical Computer Science, Vol. 224, Iss. 1, 1999-08 ,pp. : 215-235

Elsevier

Access to resources Recommend Favorite

Designing a First-Iteration Data Warehouse for a Financial Application Service Provider

Journal of Cases on Information Technology (JCIT), Vol. 4, Iss. 1, 2002-01 ,pp. : 487-498

IGI Global_journal

Access to resources Recommend Favorite

On the non-termination of MDG-based abstract state enumeration

By Mohamed O.A. Song X. Cerny E.

Theoretical Computer Science, Vol. 300, Iss. 1, 2003-05 ,pp. : 161-179

Elsevier

Access to resources Recommend Favorite