Another proof of Soittola's theorem

Authors:
Jean Berstel;Christophe Reutenauer
Affiliations:
Institut Gaspard-Monge (IGM), Université Paris-Est, France;LaCIM, Université du Québec à Montréal, Canada
Venue:
Theoretical Computer Science
Year:
2008

Citing 8
Cited 1

Rational series and their languages

Rational series and their languages
On positive matrices

Theoretical Computer Science - Special issue on discrete mathematics and applications to computer science
Nonnegative companion matrices and star-height of N-rational series

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

Advances in Applied Mathematics
Automata, Languages, and Machines

Automata, Languages, and Machines
Automata: Theoretic Aspects of Formal Power Series

Automata: Theoretic Aspects of Formal Power Series
Positivity of second order linear recurrent sequences

Discrete Applied Mathematics
Regular languages and their generating functions: The inverse problem

Theoretical Computer Science

N-rationality of a certain class of formal series

Information Processing Letters

Quantified Score

Hi-index	5.23

Visualization

Abstract

Soittola's theorem characterizes R"+- or N-rational formal power series in one variable among the rational formal power series with nonnegative coefficients. We present here a new proof of the theorem based on Soittola's and Perrin's proofs together with some new ideas that allows us to separate algebraic and analytic arguments.