Noncommutative rational Pólya series

DOI10.1007/s00029-021-00629-2OpenAlexW3163816290MaRDI QIDQ2036283

Daniel Smertnig, Jason P. Bell

Publication date: 28 June 2021

Published in: Selecta Mathematica. New Series (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1906.07271

zbMATH Keywords

noncommutative rational seriesweighted finite automataHadamard sub-invertibilityPólya seriesunambiguous rational series

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Recurrences (11B37) Algebraic theory of languages and automata (68Q70)

Related Items (5)

Polynomially ambiguous unary weighted automata over fields ⋮ D-finite multivariate series with arithmetic restrictions on their coefficients ⋮ Bideterministic weighted automata ⋮ Bideterministic weighted automata ⋮ Determinisability of unary weighted automata over the rational numbers

Cites Work

• Series formelles et algèbres syntactiques
• A new proof of two theorems about rational transductions
• A disambiguation algorithm for weighted automata
• Sequential?
• On the Determinization of Weighted Finite Automata
• Linear equations over multiplicative groups, recurrences, and mixing I
• Unit Equations in Diophantine Number Theory
• Suites récurrentes linéaires en caractéristique non nulle
• Algèbres de Hadamard
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Noncommutative rational Pólya series