## Abstract

The sequence selected from a sequence R(0)R(1)••• by a language L is the subsequence of R that contains exactly the bits R(n+1) such that the prefix R(0)••• R(n) is in L. By a result of Agafonoff, a sequence is normal if and only if any subsequence selected by a regular language is again normal. Kamae and Weiss and others have raised the question of how complex a language must be such that selecting according to the language does not preserve normality. We show that there are such languages that are only slightly more complicated than regular ones, namely, normality is preserved neither by deterministic one-counter languages nor by linear languages. In fact, for both types of languages it is possible to select a constant sequence from a normal one.

Original language | English (US) |
---|---|

Pages (from-to) | 685-697 |

Number of pages | 13 |

Journal | Theory of Computing Systems |

Volume | 39 |

Issue number | 5 |

DOIs | |

State | Published - Sep 2006 |

## All Science Journal Classification (ASJC) codes

- Theoretical Computer Science
- Computational Theory and Mathematics