Talk:State complexity

Computer science C‑class Low‑importance

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.Computer scienceWikipedia:WikiProject Computer scienceTemplate:WikiProject Computer scienceComputer science

C

This article has been rated as C-class on Wikipedia's content assessment scale.

Low

This article has been rated as Low-importance on the project's importance scale.

Things you can help WikiProject Computer science with:

Here are some tasks awaiting attention:

Article requests :
- Requested articles/Applied arts and sciences/Computer science, computing, and Internet
Cleanup :
- Computer science articles needing attention
- Computer science articles needing expert attention
Copyedit :
- Computing
Expand :
- Computer science
Infobox :
- Computer science articles without infoboxes
Maintain :
- Timeline of computing 2020–present
Photo :
- Find pictures for the biographies of computer scientists (see List of computer scientists)
- Computing articles needing images
Stubs :
- Computer science stubs
Unreferenced :
- WikiProject Computer science/Unreferenced BLPs
Project-related :
- Tag all relevant articles in Category:Computer science and sub-categories with {{WikiProject Computer science}}

State complexity of conversation NFA to DFA in the unary case

I suspect the formula $g(n)+O(n^{2})$ given for conversion of NFA to DFA is a little bit misleading. Not technically incorrect, but I would say it should state $g(n)+O(n)$ . If I look in the cited work by Chrobak, I also nowhere find any mentioning of this quadratic term, and also the proofs, in particular the lower bound, does not seem to require it. More, applying the power set construction to any unary automaton gives me the bound with a linear term. But I am not confident enough to edit it by myself, maybe I have overlooked something...