RLangGFun 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 Standard Articles 1 Publication describing the Software, including 1 Publication in zbMATH Year Regular languages and their generating functions: The inverse problem. Zbl 1133.68039Koutschan, Christoph 2008 all top 5 Cited by 10 Authors 2 Banderier, Cyril 2 Drmota, Michael 2 LavallĂ©e, Sylvain 1 Berstel, Jean 1 Bilotta, Stefano 1 Koutschan, Christoph 1 Pergola, Elisa 1 Pinzani, Renzo 1 Reutenauer, Christophe 1 Rinaldi, Simone Cited in 5 Serials 2 Theoretical Computer Science 1 Information Processing Letters 1 Journal of Computer and System Sciences 1 Linear Algebra and its Applications 1 Combinatorics, Probability and Computing Cited in 4 Fields 5 Computer science (68-XX) 4 Combinatorics (05-XX) 1 Commutative algebra (13-XX) 1 Linear and multilinear algebra; matrix theory (15-XX) Citations by Year