Unrecognizable Sets of Numbers
When is a set A of positive integers, represented as binary numbers, "regular" in the sense that it is a set of sequences that can be recognized by a finite-state machine? Let pie A(n) be the number of members of A less than the integer n. It is shown that the asymptotic behavior of pie A(...
| Hlavní autoři: | , |
|---|---|
| Jazyk: | en_US |
| Vydáno: |
2004
|
| On-line přístup: | http://hdl.handle.net/1721.1/6115 |