On Dynamic Algebras
暂无分享,去创建一个
[1] Jerzy Tiuryn,et al. Logics of Programs , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.
[2] Daniel Krob,et al. Complete Systems of B-Rational Identities , 1991, Theor. Comput. Sci..
[3] Arto Salomaa,et al. Two Complete Axiom Systems for the Algebra of Regular Events , 1966, JACM.
[4] Saharon Shelah,et al. A Variety with Solvable, but not Uniformly Solvable, Word Problem , 1993 .
[5] Dexter Kozen. A Completeness Theorem for Kleene Algebras and the Algebra of Regular Events , 1994, Inf. Comput..
[6] Zoltán Ésik,et al. Equational axioms for regular sets , 1993, Mathematical Structures in Computer Science.
[7] Trevor Evans,et al. Embeddability and the Word Problem , 1953 .
[8] Vaughan R. Pratt,et al. Dynamic algebras: Examples, constructions, applications , 1991, Stud Logica.
[9] L. Bernátsky,et al. Equational Properties of Kleene Algebras of Relations with Conversion , 1995, Theor. Comput. Sci..
[10] István Németi. Every Free Algebra in the Variety Generated by the Representable Dynamic Algebras is Separable and Representable , 1982, Theor. Comput. Sci..
[11] Z. Ésik,et al. Notes on equational theories of relations , 1995 .
[12] Sinisa Crvenkovic,et al. On Kleene Algebras , 1993, Theor. Comput. Sci..
[13] Dexter Kozen,et al. A Representation Theorem for Models of *-Free PDL , 1980, ICALP.
[14] Vaughan R. Pratt,et al. Dynamic algebras as a well-behaved fragment of relation algebras , 1988, Algebraic Logic and Universal Algebra in Computer Science.
[15] István Németi,et al. Dynamic Algebras of Programs , 1981, FCT.