Rational series and their languages
Rational series and their languages
A story about computing with roots of unity
Proceedings of the third conference on Computers and mathematics
Effective asymptotics of linear recurrences with rational coefficients
FPSAC '93 Proceedings of the 5th conference on Formal power series and algebraic combinatorics
Advances in Applied Mathematics
Godel, Escher, Bach: An Eternal Golden Braid
Godel, Escher, Bach: An Eternal Golden Braid
Automata: Theoretic Aspects of Formal Power Series
Automata: Theoretic Aspects of Formal Power Series
Regular languages and their generating functions: The inverse problem
Theoretical Computer Science
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
| Hi-index | 5.23 |
The technique of determining a generating function for an unambiguous context-free language is known as the Schutzenberger 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.