 |
HAL UPEC - UPEM Portal |  |
 |
Journal articles
On the generating sequences of regular languages on k-symbols
Abstract : The main result is a characterization of the generating sequences of the length of words in a regular language on k symbols. We say that a sequence s of integers is regular if there is a finite graph G with two vertices i, t such that sn is the number of paths of length n from i to t in G. Thus the generating sequence of a regular language is regular. We prove that a sequence s is the generating sequence of a regular language on k symbols if and only if both sequences s = ( sn)n≥0 and t = (kn − sn)n≥0 are regular.
https://hal-upec-upem.archives-ouvertes.fr/hal-00619228
Contributor : Marie-Pierre Béal Connect in order to contact the contributor
Submitted on : Sunday, February 24, 2013 - 9:16:38 AM
Last modification on : Tuesday, October 19, 2021 - 11:25:51 AM
Long-term archiving on: : Saturday, May 25, 2013 - 2:30:08 AM
Contributor : Marie-Pierre Béal Connect in order to contact the contributor
Submitted on : Sunday, February 24, 2013 - 9:16:38 AM
Last modification on : Tuesday, October 19, 2021 - 11:25:51 AM
Long-term archiving on: : Saturday, May 25, 2013 - 2:30:08 AM
File
kaire.pdf
Files produced by the author(s)