Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
9655865 | Electronic Notes in Theoretical Computer Science | 2005 | 11 Pages |
Abstract
It was already proved that the asymptotic density for k=1 exists for all binary connectives except equivalence. In this paper we prove that for every k there are exactly two accumulation points for the language based on equivalence: 0, 1/2kâ1 for asymptotic density and 1/2kâ1(4k+1), 4k/2kâ1(4k+1) for cumulative asymptotic density.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Grzegorz Matecki,