Finite axiom systems for testing preorder and De Simone process languages

Publisher： Elsevier

ISSN： 0304-3975

Source： Theoretical Computer Science, Vol.239, Iss.1, 2000-05, pp. : 97-139

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

THE PROCESS EQUATION: FORMULATING AND TESTING THE PROCESS THEORY OF SYSTEMS

By Sabelli H. Kauffman L.

Cybernetics and Systems, Vol. 30, Iss. 4, 1999-06 ,pp. : 261-294

Taylor & Francis Ltd

Access to resources Recommend Favorite

Finite Languages for the Representation of Finite Graphs

By Ehrenfeucht A. Engelfriet J. Rozenberg G.

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

Academic Press

Access to resources Recommend Favorite

Process languages and nets

By Czaja L.

Theoretical Computer Science, Vol. 238, Iss. 1, 2000-05 ,pp. : 161-181

Elsevier

Access to resources Recommend Favorite

Stochastic Finite Learning of the Pattern Languages

By Rossmanith P.

Machine Learning, Vol. 44, Iss. 1-2, 2001-07 ,pp. : 67-91

Springer Publishing Company

Access to resources Recommend Favorite

The expressiveness of a family of finite set languages

By Immerman N. Patnaik S. Stemple D.

Theoretical Computer Science, Vol. 155, Iss. 1, 1996-02 ,pp. : 111-140

Elsevier

Access to resources Recommend Favorite