The nondeterministic state complexity of the square-root operation on regular languages is exactly n^3 in the worst case.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.FL 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Nondeterministic state complexity of square root
The nondeterministic state complexity of the square-root operation on regular languages is exactly n^3 in the worst case.