Publisher
Springer Berlin Heidelberg
Reference22 articles.
1. Berman, P., Karpinski, M., Larmore, L.L., Plandowski, W., Rytter, W.: On the complexity of pattern matching for highly compressed two-dimensional texts. J. Comput. Syst. Sci. 65(2), 332–350 (2002)
2. Diekert, V., Lohrey, M., Miller, A.: Partially commutative inverse monoids. Semigroup Forum 77(2), 196–226 (2008)
3. Lawson, M.V.: Inverse Semigroups: The Theory of Partial Symmetries. World Scientific, Singapore (1999)
4. Lecture Notes in Computer Science;Y. Lifshits,2007
5. Lipton, R.J., Zalcstein, Y.: Word problems solvable in logspace. J. Assoc. Comput. Mach. 24(3), 522–526 (1977)
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Taming the hydra: The word problem and extreme integer compression;International Journal of Algebra and Computation;2018-10-15
2. Outlook;The Compressed Word Problem for Groups;2014
3. Algorithmics on SLP-compressed strings: A survey;Groups - Complexity - Cryptology;2012-01-01