Author:
Giménez Omer,Godoy Guillem,Maneth Sebastian
Publisher
Society for Industrial & Applied Mathematics (SIAM)
Subject
General Mathematics,General Computer Science
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. The HOM Problem is EXPTIME-Complete;SIAM Journal on Computing;2016-01
2. Excessively duplicating patterns represent non-regular languages;Information Processing Letters;2014-03
3. The HOM Problem Is Decidable;J ACM;2013
4. The HOM problem is decidable;Journal of the ACM;2013-08
5. The HOM Problem is EXPTIME-Complete;2012 27th Annual IEEE Symposium on Logic in Computer Science;2012-06