@article{ITA_1999__33_3_271_0, author = {Szepietowski, A.}, title = {There is no complete axiom system for shuffle expressions}, journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications}, volume = {33}, year = {1999}, pages = {271-277}, mrnumber = {1728427}, zbl = {0951.68066}, language = {en}, url = {http://dml.mathdoc.fr/item/ITA_1999__33_3_271_0} }
Szepietowski, A. There is no complete axiom system for shuffle expressions. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 33 (1999) pp. 271-277. http://gdmltest.u-ga.fr/item/ITA_1999__33_3_271_0/
[1] Axiomatizing shuffle and concatenation in languages. Inform. and Comput. 139 (1997) 62-91. | MR 1482961 | Zbl 0892.68055
and ,[2] Shuffle binoids. Theor. Informatics Appl. 32 (1998) 175-198. | Numdam | MR 1672727
and ,[3] Introduction to Automata Theory, Languages, and Computation, Addison-Wesley (1979). | MR 645539 | Zbl 0426.68001
and ,[4] The universe problem for unrestricted flow languages. Acta Inform. 19 (1983) 85-96. | MR 701879 | Zbl 0487.68065
,[5] An algebraic systems for process structuring and interprocess communication, Proc. 8 Annual Symposium on Theory of Computing (1976) 92-100. | MR 433948 | Zbl 0365.68066
,[6] Complete Systems of B-rational identities. Theoret. Comput. Sci. 89 (1991) 207-343. | MR 1133622 | Zbl 0737.68053
,[7] A solution of an interleaving decision problem by a partial order techniques, Proc. Workshop on Partial-order Methods in Verification, July 1996, Princeton NJ, Ed. G. Holzmann, D. Peled, V. Pratt, AMS-DIMACS Series in Discrete Math. | Zbl 0879.68070
and ,[8] Theory of Automata, Pergamon Press, Oxford (1969). | MR 262021 | Zbl 0193.32901
,