A polynomial-time algorithm for checking equivalence under certain semiring congruences motivated by the state-space isomorphism problem for hybrid systems

Author： DasGupta  

Publisher： Elsevier

ISSN： 0304-3975

Source： Theoretical Computer Science, Vol.262, Iss.1, 2001-07, pp. : 161-189

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

A Polynomial-Time Algorithm for Memory Space Reduction

By Song Yonghong   Wang Cheng   Li Zhiyuan  

International Journal of Parallel Programming, Vol. 33, Iss. 1, 2005-02 ,pp. : 1-33

Springer Publishing Company

Access to resources Recommend Favorite

A polynomial-time algorithm for a flow-shop batching problem with equal-length operations

By Brucker Peter  

Journal of Scheduling, Vol. 14, Iss. 4, 2011-08 ,pp. : 371-389

Springer Publishing Company

Access to resources Recommend Favorite

Hardness of equivalence checking for composed finite-state systems

By Sawa Zdeněk  

Acta Informatica, Vol. 46, Iss. 3, 2009-05 ,pp. : 169-191

Springer Publishing Company

Access to resources Recommend Favorite

A Polynomial-Time Parsing Algorithm for K -Depth Languages

By Cherubini A.   San Pietro P.  

Journal of Computer and System Sciences, Vol. 52, Iss. 1, 1996-02 ,pp. : 61-79

Academic Press

Access to resources Recommend Favorite

Polynomial-Time Algorithms for the Ordered Maximum Agreement Subtree Problem

By Dessmark Anders   Jansson Jesper   Lingas Andrzej   Lundell Eva-Marta  

Algorithmica, Vol. 48, Iss. 3, 2007-07 ,pp. : 233-248

Springer Publishing Company

Access to resources Recommend Favorite