Author： Iwama K. Kambayashi Y. Takaki K.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.237, Iss.1, 2000-04, pp. : 485-494
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
Related content
A family of NFAs which need 2 n - deterministic states
By Iwama K. Matsuura A. Paterson M.
Theoretical Computer Science, Vol. 301, Iss. 1, 2003-05 ,pp. :
Access to resources
Recommend
On the cost of recomputing: Tight bounds on pebbling with faults
By Aumann Y. Bar-Ilan J. Feige U.
Theoretical Computer Science, Vol. 233, Iss. 1, 2000-02 ,pp. :
Tight bounds on the solutions of multidimensional divide-and-conquer maximin recurrences
By Wang B.-F.
Theoretical Computer Science, Vol. 242, Iss. 1, 2000-07 ,pp. :
Tight bounds on the round complexity of distributed 1-solvable tasks
By M.S. Paterson Biran O. Moran S. Zaks S.
Theoretical Computer Science, Vol. 145, Iss. 1, 1995-07 ,pp. :
Reducing NFAs by invariant equivalences
Theoretical Computer Science, Vol. 306, Iss. 1, 2003-09 ,pp. :