Title of article :
Test Sets for the Universal and Existential Closure of Regular Tree Languages
Author/Authors :
Dieter Hofbauer، نويسنده , , Maria Huber، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 2002
Pages :
34
From page :
465
To page :
498
Keywords :
regular tree languages , Term rewriting , ground reducibility , test sets.
Journal title :
Information and Computation
Serial Year :
2002
Journal title :
Information and Computation
Record number :
262096
Link To Document :
بازگشت