Regular languages and their generating functions: The inverse problem
From MaRDI portal
Publication:2474226
DOI10.1016/j.tcs.2007.10.031zbMath1133.68039WikidataQ60692280 ScholiaQ60692280MaRDI QIDQ2474226
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
68Q45: Formal languages and automata
Related Items
RLangGFun, Characteristic polynomials of nonnegative real square matrices and generalized clique polynomials, \(\mathbb Z\)-rationality of a certain class of formal series, Another proof of Soittola's theorem
Uses Software
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