Title of article :
On path equivalence of nondeterministic finite automata
Author/Authors :
Wen-Guey Tzeng، نويسنده ,
Issue Information :
دوهفته نامه با شماره پیاپی سال 1996
Pages :
4
From page :
43
To page :
46
Keywords :
computational complexity , Path equivalence , Automaton , Algorithms
Journal title :
Information Processing Letters
Serial Year :
1996
Journal title :
Information Processing Letters
Record number :
128462
Link To Document :
https://search.isc.ac/dl/search/defaultta.aspx?DTC=10&DC=128462
بازگشت