Title of article
Solvability of word equations modulo finite special and confluent string-rewriting systems is undecidable in general
Author/Authors
Friedrich Otto، نويسنده ,
Issue Information
دوهفته نامه با شماره پیاپی سال 1995
Pages
6
From page
237
To page
242
Keywords
Formal languages , Word equations , String-rewriting
Journal title
Information Processing Letters
Serial Year
1995
Journal title
Information Processing Letters
Record number
128208
Link To Document