Synchronization Languages and Rewriting Systems

Abstract : We extend the rewriting system defined by L. Guo, K. Salomaa and S. Yu in order to characterize closure properties of synchronization languages. The extension is shown to have well-known properties of commutation systems and to be the rewriting system which suits the synchronization languages best. We give a characterization of finite synchronization languages in terms of languages closed under the extension.
Type de document :
Article dans une revue
Information and Computation, Elsevier, 2001, 167, pp.46--69
Liste complète des métadonnées
Contributeur : Isabelle Simplot-Ryl <>
Soumis le : jeudi 2 décembre 2010 - 22:48:31
Dernière modification le : mardi 24 avril 2018 - 13:29:16


  • HAL Id : inria-00542547, version 1



M. Clerbout, Y. Roos, Isabelle Ryl. Synchronization Languages and Rewriting Systems. Information and Computation, Elsevier, 2001, 167, pp.46--69. 〈inria-00542547〉



Consultations de la notice