Decimations of languages and state complexity

Authors:
Dalia Krieger;Avery Miller;Narad Rampersad;Bala Ravikumar;Jeffrey Shallit
Affiliations:
School of Computer Science, University of Waterloo, Waterloo, Ontario N2L 3G1, Canada;School of Computer Science, University of Waterloo, Waterloo, Ontario N2L 3G1, Canada;School of Computer Science, University of Waterloo, Waterloo, Ontario N2L 3G1, Canada;Computer Science Department, 141 Darwin Hall, Sonoma State University, 1801 East Cotati Avenue, Rohnert Park, CA 94928, USA;School of Computer Science, University of Waterloo, Waterloo, Ontario N2L 3G1, Canada
Venue:
Theoretical Computer Science
Year:
2009

Citing 10
Cited 2

Partial orders on words, minimal elements of regular languages, and state complexity

Theoretical Computer Science
Numeration systems, linear recurrences, and regular sets

Information and Computation
On a conjecture about slender context-free languages

Theoretical Computer Science
Thin and slender languages

Discrete Applied Mathematics
The set of minimal words of a context-free language is context-free

Journal of Computer and System Sciences
On lengths of words in context-free languages

Theoretical Computer Science
Generalization of automatic sequences for numeration systems on a regular language

Theoretical Computer Science
Automatic Sequences: Theory, Applications, Generalizations

Automatic Sequences: Theory, Applications, Generalizations
Operations preserving regular languages

Theoretical Computer Science - Foundations of computation theory (FCT 2003)
Introduction to Automata Theory, Languages, and Computation (3rd Edition)

Introduction to Automata Theory, Languages, and Computation (3rd Edition)

Abstract numeration systems

LATA'11 Proceedings of the 5th international conference on Language and automata theory and applications
State complexity of the concatenation of regular tree languages

Theoretical Computer Science

Quantified Score

Hi-index	5.23

Visualization

Abstract

Let the words of a language L be arranged in increasing radix order: L={w"0,w"1,w"2,...}. We consider transformations that extract terms from L in an arithmetic progression. For example, two such transformations are even(L)={w"0,w"2,w"4...} and odd(L)={w"1,w"3,w"5,...}. 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.