Skew and infinitary formal power series

DOI10.1016/j.tcs.2006.08.024zbMath1154.68067OpenAlexW2021542170MaRDI QIDQ860889

Dietrich Kuske, Manfred Droste

Publication date: 9 January 2007

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

Full work available at URL: https://doi.org/10.1016/j.tcs.2006.08.024

zbMATH Keywords

discountinginfinite wordsrational formal power seriesweighted Büchi-automata

Mathematics Subject Classification ID

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

Related Items (18)

Weighted automata and weighted logics with discounting ⋮ ON WEIGHTED BÜCHI AUTOMATA WITH ORDER-COMPLETE WEIGHTS ⋮ Weighted automata and weighted logics on infinite words ⋮ Probabilistic Weighted Automata ⋮ Weighted LTL with Discounting ⋮ Weighted Automata and Weighted Logics ⋮ Model Checking Linear-Time Properties of Probabilistic Systems ⋮ WEIGHTED AUTOMATA AND REGULAR EXPRESSIONS OVER VALUATION MONOIDS ⋮ On the comparison of discounted-sum automata with multiple discount factors ⋮ On weighted first-order logics with discounting ⋮ Schützenberger's theorem on formal power series follows from Kleene's theorem ⋮ Weighted automata with discounting ⋮ Approximation in Description Logics: How Weighted Tree Automata Can Help to Define the Required Concept Comparison Measures in $$\mathcal {FL}_0$$ ⋮ Regular Expressions on Average and in the Long Run ⋮ A Weighted μ-Calculus on Words ⋮ Equational Weighted Tree Transformations with Discounting ⋮ Valuations of Weighted Automata: Doing It in a Rational Way ⋮ Weighted automata

Cites Work

• Linear and combinatorial optimization in ordered algebraic structures
• An introduction to pseudo-linear algebra
• The design principles of a weighted finite-state transducer library
• The Kleene-Schützenberger theorem for formal power series in partially commuting variables.
• Infinite fuzzy computations
• On the Determinization of Weighted Finite Automata
• Weak Second‐Order Arithmetic and Finite Automata
• On the definition of a family of automata
• All Infinite Groups are Galois Groups Over any Field
• Finite Automata Computing Real Functions
• Stochastic Games
• Unnamed Item
• 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: Skew and infinitary formal power series