From Wikipedia, the free encyclopedia
 |
This article is within the scope of WikiProject Computer science, a collaborative effort to improve the coverage of Computer science related articles on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks. |
|
 Stub |
This article has been rated as Stub-Class on the project's quality scale. |
| ??? |
This article has not yet received a rating on the project's importance scale. |
|
|
"The answer is yes." The answer to what is yes?
"The answer to all questions is yes" - The answer to all three questions, or all two questions? If this is just referring to the last two questions, it makes more sense to me, but then it should say "The answer to *both* questions is yes". A5 00:24, 13 Sep 2004 (UTC)
What is the non-elementary complexity of the algorithm? Is it possible to elaborate on this? Absolt (talk) 14:51, 20 July 2008 (UTC)
- I am not aware of an explicit upper bound for the running time of Hashiguchi's algorithm ("non-elementary" gives a lower bound on the running time; I suppose you know what non-elementary means; otherwise, see ELEMENTARY). It is extremely impractical anyway: An informal discussion, including some concrete numbers for a small example, is found at page 2, in this work:
- S. Lombardy, J. Sakarovitch:"Star Height of Reversible Languages and Universal Automata", LATIN 2002.
- Hermel (talk) 11:42, 24 July 2008 (UTC)
