Title of article
Reachability and confluence are undecidable for flat term rewriting systems
Author/Authors
Florent Jacquemard، نويسنده ,
Issue Information
دوهفته نامه با شماره پیاپی سال 2003
Pages
6
From page
265
To page
270
Keywords
Term rewriting , Theory of computation
Journal title
Information Processing Letters
Serial Year
2003
Journal title
Information Processing Letters
Record number
129773
Link To Document