On transformations of formal power series.

DOI10.1016/S0890-5401(03)00066-XzbMath1055.68066MaRDI QIDQ1401954

D. Massart

Publication date: 19 August 2003

Published in: Information and Computation (Search for Journal in Brave)

zbMATH Keywords

Formal power seriesRational languagesWeighted finite automataRecognizable languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items

Definable transductions and weighted logics for texts ⋮ Weighted Automata and Weighted Logics ⋮ Newton’s Forward Difference Equation for Functions from Words to Words ⋮ On quotients of formal power series ⋮ A noncommutative extension of Mahler's theorem on interpolation series ⋮ Rational Transformations and a Kleene Theorem for Power Series over Rational Monoids

Cites Work

• Algorithms for determining relative star height and star height
• Linear and combinatorial optimization in ordered algebraic structures
• Regularity-preserving relations
• Automata, Boolean matrices, and ultimate periodicity.
• On the definition of a family of automata
• Regularity preserving modifications of regular expressions
• Methods and applications of (max,+) linear algebra
• Context-free recognition with weighted automata
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item