Counting with rational functions

DOI10.1016/0304-3975(88)90020-5zbMath0664.68057OpenAlexW2005407474MaRDI QIDQ1115616

Christian Choffrut

Publication date: 1988

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

Full work available at URL: https://doi.org/10.1016/0304-3975(88)90020-5

zbMATH Keywords

automatarational functionscounting functionfree monoidsemaphorefactor distance

Mathematics Subject Classification ID

Free semigroups, generators and relations, word problems (20M05) Algebraic theory of languages and automata (68Q70) Semigroups in automata theory, linguistics, etc. (20M35)

Related Items (2)

A Circuit Complexity Approach to Transductions ⋮ The ring of \(k\)-regular sequences

Cites Work

• The equation \(a_ M=b^ Nc^ P\) in a free group
• Transductions des langages de Chomsky
• Sur une variante des fonctions séquentielles
• On a Theorem of R. Jungen
• A Characterization of Machine Mappings
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Counting with rational functions