Regularity and Context-Freeness over Word Rewriting Systems - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2011

Regularity and Context-Freeness over Word Rewriting Systems

Didier Caucal
Trong Hiêu Dinh
  • Fonction : Auteur
  • PersonId : 765589
  • IdRef : 158129458

Résumé

We describe a general decomposition mechanism to express the derivation relation of a word rewriting system R as the composition of a (regular) substitution followed by the derivation relation of a system R′ ∪ D, where R′ is a strict sub-system of R and D is the Dyck rewriting system. From this decomposition, we deduce that the system R (resp. R − 1) preserves regular (resp. context-free) languages whenever R′ ∪ D (resp. its inverse) does. From this we can deduce regularity and context-freeness preservation properties for a generalization of tagged bifix systems.
Fichier principal
Vignette du fichier
Fossacs.pdf (177.5 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00867572 , version 1 (30-09-2013)

Identifiants

Citer

Didier Caucal, Trong Hiêu Dinh. Regularity and Context-Freeness over Word Rewriting Systems. FOSSACS 2011, Mar 2011, Saarbrücken, Germany. pp.214-228, ⟨10.1007/978-3-642-19805-2_15⟩. ⟨hal-00867572⟩
90 Consultations
100 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More