swMATH ID: 14280
Software Authors: Koutschan, Christoph
Description: Regular languages and their generating functions: The inverse problem. The technique of determining a generating function for an unambiguous context-free language is known as the Sch”utzenberger 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 \(mathbb N\)-rationality. In addition, some aspects and problems concerning the implementation are discussed; some examples from combinatorics illustrate its applicability.
Homepage: http://www.risc.jku.at/research/combinat/software/RLangGFun/index.php
Dependencies: Maple
Keywords: formal power series; regular language; Soittola’s theorem; integer sequence; \(N\)-rationality
Related Software: RNAsubopt; RNAfold; Maple; OEIS
Cited in: 7 Publications

Citations by Year