Reducing the gradedness problem of string rewriting systems to a termination problem∗

E-ISSN： 1290-385x|49|3|233-254

ISSN： 0988-3754

Source： RAIRO - Theoretical Informatics and Applications, Vol.49, Iss.3, 2015-12, pp. : 233-254

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

Non-Looping String Rewriting

By Geser Alfons Zantema Hans

RAIRO - Theoretical Informatics and Applications, Vol. 33, Iss. 3, 2010-03 ,pp. : 279-301

Edp Sciences

Access to resources Recommend Favorite

An Improved Cuckoo Search for a Patient Transportation Problem with Consideration of Reducing Transport Emissions

By Xiao Liyang Dridi Mahjoub Hajjam El Hassani Amir Fei Hongying Lin Wanlong

Sustainability, Vol. 10, Iss. 3, 2018-03 ,pp. : 793-793

MDPI

Access to resources Recommend Favorite

Bidirectional string assembling systems

By Kutrib Martin Wendlandt Matthias

RAIRO - Theoretical Informatics and Applications, Vol. 48, Iss. 1, 2014-03 ,pp. : 39-59

Edp Sciences

Access to resources Recommend Favorite

String Assembling Systems

By Kutrib Martin Wendlandt Matthias

RAIRO - Theoretical Informatics and Applications, Vol. 46, Iss. 4, 2012-11 ,pp. : 593-613

Edp Sciences

Access to resources Recommend Favorite

PACKAGED ACTIVATED SLUDGE TREATMENT SYSTEMS A NEW APPROACH TO THE SMALL FLOWS PROBLEM

By Hombach H. Peter Hombach Sven T. Motnenko Irena West James Schalk Ulrich

Proceedings of the Water Environment Federation, Vol. 2001, Iss. 11, 2001-01 ,pp. : 89-98

Water Environment Federation

Access to resources Recommend Favorite