@**article**{RISC3078,author = {Christoph Koutschan},

title = {{Regular Languages and Their Generating Functions: The Inverse Problem}},

language = {english},

abstract = {The technique of determining a generating function for an unambiguous context-free language is known as the Schuetzenberger methodology. For regular languages, Elena Barcucci et al. proposed an approach for inverting this methodology based on Soittola's theorem. This idea allows a combinatorial interpretation (by means of a regular language) of certain positive integer sequences that are defined by C-finite recurrences.
In this paper we present a Maple implementation of this inverse methodology and describe various applications. We give a short introduction to the underlying theory, i.e., the question of deciding N-rationality. In addition, some aspects and problems concerning the implementation are discussed; some examples from combinatorics illustrate its applicability.},

journal = {Theoretical Computer Science},

volume = {391},

number = {1-2},

pages = {65--74},

isbn_issn = {ISSN 0304-3975},

year = {2008},

refereed = {yes},

length = {10}

}