Author:
Seidl Helmut,Neumann Andreas
Publisher
Springer Berlin Heidelberg
Reference20 articles.
1. H.R. Andersen, C. Stirling, and G. Winskel. A Compositional Proof System for the Modal Mu-Calculus. In IEEE Conf. on Logic in Computer Science (LICS), 144–153, 1994.
2. A. Arnold and M. Nivat. Metric Interpretations of Infinite Trees and Semantics of Non-Deterministic Recursive Programs. Theoretical Computer Science (TCS), 11:181–205, 1980.
3. H. Bekic. Definable Operations in General Algebras, and the Theory of Automata and Flowcharts. Technical Report, IBM Labor, Wien, 1967.
4. Lect Notes Comput Sci;F. Bourdoncle,1993
5. B. Courcelle. Basic Notions of Universal Algebra for Language Theory and Graph Grammars. Theoretical Computer Science (TCS), 163(1&2):1–54, 1996.
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献