Regular Article: A Technology for Reverse-Engineering a Combinatorial Problem from a Rational Generating Function

Authors:
E. Barcucci;A. Del Lungo;A. Frosini;S. Rinaldi
Affiliations:
Dipartimento di Sistemi e Informatica, Università di Firenze, Via Lombroso 6/17, 50134, Firenze, Italyf1barcucci@dsi.unifi.itf1;Dipartimento di Matematica, Università di Siena, Via del Capitano 15, 53100, Siena, Italy;Dipartimento di Matematica, Università di Siena, Via del Capitano 15, 53100, Siena, Italy;Dipartimento di Sistemi e Informatica, Università di Firenze, Via Lombroso 6/17, 50134, Firenze, Italyf2rinaldi@dsi.unifi.itf2
Venue:
Advances in Applied Mathematics
Year:
2001

Citing 0
Cited 6

Editorial: in memoriam: Alberto Del Lungo (1965-2003)

Theoretical Computer Science - In memoriam: Alberto Del Lungo (1965-2003)
Regular languages and their generating functions: The inverse problem

Theoretical Computer Science
Another proof of Soittola's theorem

Theoretical Computer Science
N-rationality of a certain class of formal series

Information Processing Letters
The specker-blatter theorem revisited

COCOON'03 Proceedings of the 9th annual international conference on Computing and combinatorics
Definability of combinatorial functions and their linear recurrence relations

Fields of logic and computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we tackle the problem of giving, by means of a regular language, a combinatorial interpretation of a positive sequence (f"n) defined by a linear recurrence with integer coefficients. We propose two algorithms able to determine if the rational generating function of (f"n), f(x), is the generating function of some regular language, and, in the affirmative case, to find it. We illustrate some applications of this method to combinatorial object enumeration problems and bijective combinatorics and discuss an open problem regarding languages having a rational generating function.