Title of article :
Completeness results concerning systolic tree automata and E0L languages
Author/Authors :
Angelo Monti، نويسنده , , Alessandro Roncato، نويسنده ,
Issue Information :
دوهفته نامه با شماره پیاپی سال 1995
Pages :
6
From page :
11
To page :
16
Keywords :
Fonnal languages , EOL , computational complexity , PSPACE-completeness , Tree automata
Journal title :
Information Processing Letters
Serial Year :
1995
Journal title :
Information Processing Letters
Record number :
128178
Link To Document :
https://search.isc.ac/dl/search/defaultta.aspx?DTC=10&DC=128178
بازگشت