Rational series and their languages
Rational series and their languages
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
Regular languages and their generating functions: The inverse problem
Theoretical Computer Science
Another proof of Soittola's theorem
Theoretical Computer Science
Hi-index | 0.89 |
A series of the form (1-ax+bx^k)^-^1, where a@?N, b@?Z and k=2@?N is N-rational if and only if (k-1)^k^-^1a^k-k^kb=0.