Homomorphisms and concurrent term rewriting - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 1999

Homomorphisms and concurrent term rewriting

Résumé

In this paper we study applications of relations based on rewrite systems to regular tree languages. For instance, we want to deal with decidability problems of the form “R el(L 1) ⊆ L 2” where L 1, L 2 are regular tree languages and R el can be either IO, OI, parallel, or one step rewriting for a given rewrite system. Our method somehow standardizes previous ones because it reveals conditions R el must fulfill to preserve recognizability for the language R el(L 1). Thanks to classes of recognizable languages wider than the regular one, we get some new results. We pursue this method to tackle the problem of computing the set of descendants of a regular tree language by a rewrite system.

Dates et versions

hal-02193779 , version 1 (24-07-2019)

Identifiants

Citer

Franck Seynhaeve, Sophie Tison, Marc Tommasi. Homomorphisms and concurrent term rewriting. FCT 1999 - International Symposium on Fundamentals of Computation Theory, Aug 1999, Iasi, Romania. pp.475-487, ⟨10.1007/3-540-48321-7_40⟩. ⟨hal-02193779⟩
23 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More