Publisher
Springer Berlin Heidelberg
Reference14 articles.
1. L. Aceto. Full abstraction for series-parallel pomsets, in Proc. TAPSOFT 91, LNCS
493, Springer (1991) 1–40.
2. G. Boudol and I. Castellani. Concurrency and atomicity, TCS
59 (1988) 25–84.
3. S. Bloom and Z. Ésik. Free shuffle algebras in language varieties, TCS
163 (1996) 55–98.
4. J.R. Büchi. Finite automata, their algebras and grammars: Towards a theory of formal expressions (D. Siefkes, ed.), Springer (1989).
5. B. Courcelle. Graph rewriting: an algebraic and logical approach, in Handbook of Theoretical Computer Science
B (J. van Leeuwen, ed.), Elsevier (1990) 193–242.
Cited by
20 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献