Subject
Computer Science Applications,General Mathematics,Software
Reference22 articles.
1. [Blo76] BLOOM S. L., Varieties of ordered algebras. Journal of Computer and System Sciences, Vol. 45, 1976, pp. 200-212.4272040337.06008
2. [BÉ95] BLOOM S. L. and ÉSIK Z., Nonfinite axiomatizability of shuffle inequalities. In Proceedings of TAPSOFT'95, volume 915 of Lecture Notes in Computer Science, 1995, pp. 318-333.
3. [BÉ96] BLOOM S. L. and ÉSIK Z., Free shuffle algebras in language varieties. Theoretical Computer Science, Vol. 163, 1996, pp. 55-98.14070150874.68171
4. [BÉ97] BLOOM S. L. and ÉSIK Z., Axiomatizing shuffle and concatenation in languages. Information and Computation, Vol. 139, 1997, pp. 62-91.14829610892.68055
5. [BÉSt] BLOOM S. L., ÉSIK Z. and STEFANESCU Gh., Equational theories of relations and regular sets. In Proc. of Words, Languages and Combinatorics, II, M. ITO and M. JÜRGENSEN Eds., Kyoto, 1992 World Scientific, 1994, pp. 40-48.13512780874.08002
Cited by
15 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献