Author:
Bloom Stephen L,Ésik Zoltán
Subject
Computational Theory and Mathematics,Computer Science Applications,Information Systems,Theoretical Computer Science
Reference14 articles.
1. Equational axioms for regular sets;Bloom;Math. Structures Comput. Sci.,1993
2. Nonfinite axiomatizability of shuffle inequalities;Bloom,1995
3. Free shuffle algebras in language varieties;Bloom;Theoret. Comput. Sci.,1996
4. Varieties of ordered algebras;Bloom;J. Comput. System Sci.,1976
5. Nonfinite axiomatizability of the equational theory of shuffle;Ésik,1995
Cited by
12 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. On Hardy-type inequalities for weighted means;Banach Journal of Mathematical Analysis;2019-01
2. On Kedlaya-type inequalities for weighted means;Journal of Inequalities and Applications;2018-04-25
3. Quotients of Unbounded Parallelism;Theoretical Aspects of Computing - ICTAC 2015;2015
4. Shuffled languages—Representation and recognition;Theoretical Computer Science;2013-06
5. A Hierarchy of Languages with Catenation and Shuffle;Fundamenta Informaticae;2013