Nonfinite axiomatizability of shuffle inequalities-Reference-Cited by-同舟云学术

Nonfinite axiomatizability of shuffle inequalities

Published:1995 Issue: Volume: Page:318-333
ISSN:0302-9743
Container-title:TAPSOFT '95: Theory and Practice of Software Development
language:
Short-container-title:

Author:

Bloom Stephen L.,Ésik Zoltán

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-59293-8_204.pdf

Reference10 articles.

1. L. Aceto. Full abstraction for series-parallel pomsets. In Proceedings of TAPSOFT'91, volume 493 of Lecture Notes in Computer Science, pages 1–40. Springer-Verlag, 1991.

2. L. Aceto and M. Hennessy. Towards action refinement in process algebras. Information and Computation, 103(2):204–269, 1993.

3. S. L. Bloom. Varieties of ordered algebras. Journal of Computer and System Sciences, 45:200–212, 1976.

4. S. L. Bloom and Z. Ésik. Free Shuffle Algebras in Language Varieties. To appear. Obtainable by anonymous ftp from menger.eecs.stevens-tech.edu in directory pub/bloom/shuffle.

5. Z. Ésik and M. Bertol. Nonfinite axiomatizability of the equational theory of shuffle. To appear.

Cited by 8 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Some Results of Zoltán Ésik on Regular Languages;Fundamentals of Computation Theory;2017

2. Lifting non-finite axiomatizability results to extensions of process algebras;Acta Informatica;2010-02-04

3. CCS with Hennessy's merge has no finite-equational axiomatization;Theoretical Computer Science;2005-02

4. Long words: the theory of concatenation and ω-power;Theoretical Computer Science;2001-05

5. Shuffle binoids;RAIRO - Theoretical Informatics and Applications;1998