Title of article
Communication Complexity Method for Measuring Nondeterminism in Finite Automata
Author/Authors
Juraj Hromkovi ، نويسنده , , Sebastian Seibert، نويسنده , , Juhani Karhumaki، نويسنده , , Hartmut Klauck، نويسنده , , Georg Schnitger، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2002
Pages
16
From page
202
To page
217
Keywords
finite automata , nondeterminism , limited ambiguity , Descriptional complexity , communicationcomplexity.
Journal title
Information and Computation
Serial Year
2002
Journal title
Information and Computation
Record number
262028
Link To Document