From rational functions to regular languages
From MaRDI portal
Recommendations
- A necessary condition for the rationality of the zeta function of a regular language
- Regular languages and their generating functions: The inverse problem
- A technology for reverse-engineering a combinatorial problem from a rational generating function
- scientific article; zbMATH DE number 4096799
- scientific article; zbMATH DE number 4116001
Cited in
(12)- Prefix and equality languages of rational functions are co-context-free
- An algebraic characterization of the set of succession rules
- Bijections and the Riordan group
- Enumerating regular expressions and their languages
- Regular languages as local functions with small alphabets
- Regular languages and their generating functions: The inverse problem
- On the generating sequences of regular languages on \(k\) symbols
- scientific article; zbMATH DE number 41838 (Why is no real title available?)
- Regularity of languages defined by formal series with isolated cut point
- scientific article; zbMATH DE number 4116001 (Why is no real title available?)
- scientific article; zbMATH DE number 2097480 (Why is no real title available?)
- A technology for reverse-engineering a combinatorial problem from a rational generating function
This page was built for publication: From rational functions to regular languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4502584)