On the Coalgebraic Theory of Kleene Algebra with Tests
暂无分享,去创建一个
[1] Alexandra Silva,et al. A Kleene Theorem for Polynomial Coalgebras , 2009, FoSSaCS.
[2] J. Conway. Regular algebra and finite machines , 1971 .
[3] S C Kleene,et al. Representation of Events in Nerve Nets and Finite Automata , 1951 .
[4] Walter J. Savitch,et al. Relationships Between Nondeterministic and Deterministic Tape Complexities , 1970, J. Comput. Syst. Sci..
[5] Dexter Kozen. A Completeness Theorem for Kleene Algebras and the Algebra of Regular Events , 1994, Inf. Comput..
[6] Donald M. Kaplan,et al. Regular Expressions and the Equivalence of Programs , 1969, J. Comput. Syst. Sci..
[7] D. Kozen,et al. The Complexity of Kleene Algebra with Tests , 1996 .
[8] Jan J. M. M. Rutten,et al. Automata and Coinduction (An Exercise in Coalgebra) , 1998, CONCUR.
[9] Dexter Kozen,et al. On Hoare logic and Kleene algebra with tests , 1999, Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158).
[10] Dexter Kozen,et al. Kleene algebra with tests , 1997, TOPL.
[11] Janusz A. Brzozowski,et al. Derivatives of Regular Expressions , 1964, JACM.
[12] D. Kozen. Automata on Guarded Strings and Applications , 2001 .
[13] Marcello M. Bonsangue,et al. Regular expressions for polynomial coalgebras , 2007 .
[14] Riccardo Pucella,et al. A Coalgebraic Approach to Kleene Algebra with Tests , 2003, CMCS.
[15] James Worthington. Automatic Proof Generation in Kleene Algebra , 2008, RelMiCS.
[16] Dexter Kozen,et al. Kleene Algebra with Tests: Completeness and Decidability , 1996, CSL.