Title of article :
Complexity of weak acceptance conditions in tree automata
Author/Authors :
Jakub Neumann، نويسنده , , Andrzej Szepietowski، نويسنده , , Igor Walukiewicz، نويسنده ,
Issue Information :
دوهفته نامه با شماره پیاپی سال 2002
Pages :
7
From page :
181
To page :
187
Keywords :
computational complexity , Formal languages , Tree automata , Weak conditions , Emptiness problem
Journal title :
Information Processing Letters
Serial Year :
2002
Journal title :
Information Processing Letters
Record number :
129607
Link To Document :
https://search.isc.ac/dl/search/defaultta.aspx?DTC=10&DC=129607
بازگشت