Publisher
Springer Berlin Heidelberg
Reference22 articles.
1. Anselmo, M., Restivo, A.: On languages factorizing the free monoid. Internat. J. Algebra and Computation 6, 413–427 (1996)
2. Câmpeanu, C., Salomaa, K., Vágvölgyi, S.: Shuffle decompositions of regular languages. Internat. J. Foundations of Computer Science 13, 799–816 (2002)
3. Conway, J.H.: Regular Algebra and Finite Machines. Chapman and Hall, Boca Raton (1971)
4. Czyzowicz, J., Fraczak, W., Pelc, A., Rytter, W.: Linear-time prime decomposition of regular prefix codes. Internat. J. Foundations of Computer Science 14, 1019–1031 (2003)
5. Daley, M., Domaratzki, M., Salomaa, K.: On the operational orthogonality of languages. In: Kunc, M., Okhotin, A. (eds.) Proc. of Theory and Applications of Language Equations, Turku, Finland, pp. 43–53 (2007)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Schema design for XML repositories;Proceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems of data - PODS '10;2010