Decimations of languages and state complexity

  • Krieger D
  • Miller A
  • Rampersad N
 et al. 
  • 3

    Readers

    Mendeley users who have this article in their library.
  • 5

    Citations

    Citations of this article.

Abstract

Let the words of a language L be arranged in increasing radix order: L = {w0, w1, w2, ...}. We consider transformations that extract terms from L in an arithmetic progression. For example, two such transformations are even (L) = {w0, w2, w4 ...} and odd (L) = {w1, w3, w5, ...}. Lecomte and Rigo observed that if L is regular, then so are even (L), odd (L), and analogous transformations of L. We find good upper and lower bounds on the state complexity of this transformation. We also give an example of a context-free language L such that even (L) is not context-free. © 2009 Elsevier B.V. All rights reserved.

Author-supplied keywords

  • Context-free language
  • Decimation
  • Deterministic finite automaton
  • Slender language
  • State complexity

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document

Authors

  • Dalia Krieger

  • Avery Miller

  • Narad Rampersad

  • Bala Ravikumar

  • Jeffrey Shallit

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free