Author:
Bloom Stephen L.,Choffrut Christian
Subject
General Computer Science,Theoretical Computer Science
Reference10 articles.
1. S.L. Bloom, Z. Ésik, Nonfinite axiomatizability of shuffle inequalities, Proc. TAPSOFT ’95, Lecture Notes in Computer Science, vol. 915, 1995, pp. 318–333.
2. Free shuffle algebras in language varieties;Bloom;Theoret. Comput. Sci.,1996
3. Shuffle binoids;Bloom;Theoret. Inform. Appl.,1998
4. Finite automata, definable sets and regular expressions over ωn-tapes;Choueka;J. Comput. Systems Sci.,1978
5. Equations in transfinite strings;Choffrut,1998
Cited by
21 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献