Publisher
Springer Berlin Heidelberg
Reference25 articles.
1. P. Aczel. Non-well-founded sets. Number 14 in CSLI Lecture Notes. Center for the Study of Languages and Information, Stanford, 1988.
2. P. Aczel and N. Mendler. A final coalgebra theorem. In D.H. Pitt, D.E. Ryeheard, P. Dybjer, A. M. Pitts, and A. Poigne, editors, Proceedings category theory and computer science, Lecture Notes in Computer Science, pages 357–365, 1989.
3. J. Barwise and L.S. Moss. Vicious Circles, On the Mathematics of Non wellfounded Phenomena. CSLI Lecture Notes. Center for the Study of Language and Information, Stanford, 1996.
4. J.A. Brzozowski. Derivatives of regular expressions. Journal of the ACM, 11(4):481–494, 1964.
5. G. Berry and R. Sethi. From regular expressions to deterministic automata. Theoretical Computer Science, 48:117–126, 1986.
Cited by
113 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献