Title of article :
Reachability and confluence are undecidable for flat term rewriting systems
Author/Authors :
Florent Jacquemard، نويسنده ,
Issue Information :
دوهفته نامه با شماره پیاپی سال 2003
Keywords :
Term rewriting , Theory of computation
Journal title :
Information Processing Letters
Journal title :
Information Processing Letters
