A property of left-linear rewrite systems preserving recognizability

Publisher： Elsevier

ISSN： 0304-3975

Source： Theoretical Computer Science, Vol.242, Iss.1, 2000-07, pp. : 477-498

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

Linear generalized semi-monadic rewrite systems effectively preserve recognizability

By Gyenizse P. Vagvolgyi S.

Theoretical Computer Science, Vol. 194, Iss. 1, 1998-03 ,pp. : 87-122

Elsevier

Access to resources Recommend Favorite

Modular termination of r-consistent and left-linear term rewriting systems

By Schmidt-Schausz M. Marchiori M. Panitz S.E.

Theoretical Computer Science, Vol. 149, Iss. 2, 1995-10 ,pp. : 361-374

Elsevier

Access to resources Recommend Favorite

Right-linear half-monadic term rewrite systems

By Vagvolgyi S.

Theoretical Computer Science, Vol. 309, Iss. 1, 2003-12 ,pp. : 195-211

Elsevier

Access to resources Recommend Favorite

Bertrand numeration systems and recognizability

By Bruyere V. Hansel G.

Theoretical Computer Science, Vol. 181, Iss. 1, 1997-07 ,pp. : 17-43

Elsevier

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