A polynomial algorithm testing partial confluence of basic semi-Thue systems

Publisher： Elsevier

ISSN： 0304-3975

Source： Theoretical Computer Science, Vol.192, Iss.1, 1998-02, pp. : 55-75

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

Some undecidable termination problems for semi-Thue systems

By Senizergues G.

Theoretical Computer Science, Vol. 142, Iss. 2, 1995-05 ,pp. : 257-276

Elsevier

Access to resources Recommend Favorite

Partial confluence of processes and systems of objects

By Xinxin L. Walker D.

Theoretical Computer Science, Vol. 206, Iss. 1, 1998-10 ,pp. : 127-162

Elsevier

Access to resources Recommend Favorite

A Polynomial Algorithm for Diagnosability Analysis of Discrete Event Systems

International Journal of Adaptive, Resilient and Autonomic Systems (IJARAS), Vol. 6, Iss. 2, 2015-07 ,pp. : 1-22

IGI Global_journal

Access to resources Recommend Favorite

Transformations and confluence for rewrite systems

By Verma R.M.

Theoretical Computer Science, Vol. 152, Iss. 2, 1995-12 ,pp. : 269-283

Elsevier

Access to resources Recommend Favorite

Decomposing solution sets of polynomial systems: a new parallel monodromy breakup algorithm

By Leykin Anton Verschelde Jan

International Journal of Computational Science and Engineering, Vol. 4, Iss. 2, 2009-07 ,pp. : 94-101

Inderscience Publishers

Access to resources Recommend Favorite