Computing Linearizations Using Test Sets

Authors:
Dieter Hofbauer;Maria Huber
Affiliations:
-;-
Venue:
CTRS '92 Proceedings of the Third International Workshop on Conditional Term Rewriting Systems
Year:
1992

On ground reducibility problem for word rewriting systems with variables

SAC '94 Proceedings of the 1994 ACM symposium on Applied computing
Patterns in Words versus Patterns in Trees: A Brief Survey and New Results

PSI '99 Proceedings of the Third International Andrei Ershov Memorial Conference on Perspectives of System Informatics
The HOM problem is decidable

Proceedings of the forty-second ACM symposium on Theory of computing
The HOM Problem is EXPTIME-Complete

LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
The HOM problem is decidable

Journal of the ACM (JACM)

Hi-index	0.00