- Record: found
- Abstract: not found
- Book Chapter: not found
On the Complexity of the Equivalence Problem for Probabilistic Automata
other
Read this book at
There is no author summary for this book yet. Authors can add summaries to their books on ScienceOpen to make them more accessible to a non-specialist audience.
Related collections
Most cited references22
- Record: found
- Abstract: not found
- Article: not found
Fast Probabilistic Algorithms for Verification of Polynomial Identities
J. T. Schwartz (1980)
- Record: found
- Abstract: not found
- Article: not found
On the definition of a family of automata
M.P. Schützenberger (1961)
- Record: found
- Abstract: not found
- Book Chapter: not found
Probabilistic algorithms for sparse polynomials
Richard Zippel (1979)