مرکز منطقه ای اطلاع رساني علوم و فناوري - Infinity problems and countability problems for ω-automata

Title of article :

Infinity problems and countability problems for ω-automata

Author/Authors :

Yunfeng Tao، نويسنده ,

Issue Information :

دوهفته نامه با شماره پیاپی سال 2006

Pages :

From page :

151

To page :

153

Keywords :

Formal languages , ?-automaton , Cardinality , complexity

Journal title :

Information Processing Letters

Serial Year :

2006

Journal title :

Information Processing Letters

Record number :

130331

Link To Document :