Title of article
A note on emptiness for alternating finite automata with a one-letter alphabet
Author/Authors
Petr Jan?ar، نويسنده , , Zden?k Sawa، نويسنده ,
Issue Information
دوهفته نامه با شماره پیاپی سال 2007
Pages
4
From page
164
To page
167
Keywords
computational complexity , Alternating finite automaton , Emptiness
Journal title
Information Processing Letters
Serial Year
2007
Journal title
Information Processing Letters
Record number
130508
Link To Document