论文信息 - On the Equivalence of Synchronization Sets

On the Equivalence of Synchronization Sets

In the framework of the description of processes behaviours by words and languages, conditions of synchronization can be expressed by the means of regular sets. Two problems about such synchronization sets are studied here: the decidability of the equivalence of two of them and the obtention of minimal ones.

Béatrice Bérard | Joffroy Beauquier

[1] Maurice Nivat,et al. APPLICATION OF FORMAL LANGUAGE THEORY TO PROBLEMS OF SECURITY AND SYNCHRONIZATION , 1980 .

[2] Michel Latteux,et al. Cônes rationnels commutatifs , 1979, J. Comput. Syst. Sci..

[3] Jean Berstel,et al. Transductions and context-free languages , 1979, Teubner Studienbücher : Informatik.

[4] Jonathan Goldstine,et al. Substitution and Bounded Languages , 1972, J. Comput. Syst. Sci..

[5] David K. Gifford,et al. The space shuttle primary computer system , 1984, CACM.

[6] Seymour Ginsburg,et al. Algebraic and Automata Theoretic Properties of Formal Languages , 1975 .