论文信息 - Valid Identity Problem for Shuffle Regular Expressions

Valid Identity Problem for Shuffle Regular Expressions

We show that the following problem is decidable: given are expressions E1 and E2 constructed from variables by the regular operations and shuffle. Is the identity E1 = E2 true for all instantiations of its variables by formal languages?

Albert R. Meyer | Alexander Moshe Rabinovich

[1] Albert R. Meyer,et al. A solution of an interleaving decision problem by a partial order technique , 1996, Partial Order Methods in Verification.

[2] Vaughan R. Pratt,et al. On the composition of processes , 1982, POPL '82.

[3] 守屋悦朗,et al. J.E.Hopcroft, J.D. Ullman 著, "Introduction to Automata Theory, Languages, and Computation", Addison-Wesley, A5変形版, X+418, \6,670, 1979 , 1980 .

[4] Luca Aceto,et al. Failures Semantics for a Simple Process Language with Refinement , 1991, FSTTCS.

[5] Dominique Perrin,et al. Finite Automata , 1958, Philosophy.

[6] Zoltán Ésik,et al. Free Shuffle Algebras in Language Varieties , 1996, Theor. Comput. Sci..

[7] Alain J. Mayer,et al. The Complexity of Word Problems - This Time with Interleaving , 1994, Inf. Comput..

[8] M. W. Shields. An Introduction to Automata Theory , 1988 .

[9] Jeffrey D. Ullman,et al. Introduction to Automata Theory, Languages and Computation , 1979 .

[10] Daniele Micciancio. The validity problem for extended regular expressions , 1996 .

[11] Jay Loren Gischer,et al. Partial orders and the axiomatic theory of shuffle (pomsets) , 1985 .