Regular languages and their generating functions: The inverse problem

DOI10.1016/j.tcs.2007.10.031zbMath1133.68039OpenAlexW2037177803WikidataQ60692280 ScholiaQ60692280MaRDI QIDQ2474226

Christoph Koutschan

Publication date: 5 March 2008

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2007.10.031

zbMATH Keywords

regular languageformal power seriesinteger sequence\(N\)-rationalitySoittola's theorem

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items

Recurrence relations, succession rules and the positivity problem, Formulae and Asymptotics for Coefficients of Algebraic Functions, Another proof of Soittola's theorem, Characteristic polynomials of nonnegative real square matrices and generalized clique polynomials, \(\mathbb Z\)-rationality of a certain class of formal series, Recurrence Relations, Succession Rules, and the Positivity Problem, RLangGFun

Uses Software

• Maple
• OEIS

Cites Work

• Positive rational sequences
• Effective asymptotics of linear recurrences with rational coefficients
• The On-Line Encyclopedia of Integer Sequences
• Formal Power Series
• A technology for reverse-engineering a combinatorial problem from a rational generating function
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item