Author： Simon Hans Ulrich
Publisher： Springer Publishing Company
ISSN： 1432-4350
Source： Theory of Computing Systems, Vol.37, Iss.1, 2004-01, pp. : 77-94
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
How many winners will there be?
The Mathematical Gazette, Vol. 96, Iss. 537, 2012-11 ,pp. :
Access to resources
Recommend
How many dead ends in a derangement?
The Mathematical Gazette, Vol. 97, Iss. 538, 2013-03 ,pp. :
Query Learning of Regular Tree Languages: How to Avoid Dead States
By Drewes Frank
Theory of Computing Systems, Vol. 40, Iss. 2, 2007-02 ,pp. :
How many bins should be put in a regularhistogram
By Birgé Lucien Rozenholc Yves
ESAIM: Probability and Statistics, Vol. 10, Iss. issue, 2006-01 ,pp. :