Skew and infinitary formal power series
From MaRDI portal
Publication:860889
DOI10.1016/J.TCS.2006.08.024zbMATH Open1154.68067OpenAlexW2021542170MaRDI QIDQ860889FDOQ860889
Authors: Manfred Droste, Dietrich Kuske
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
Recommendations
Cites Work
- Stochastic Games
- Title not available (Why is that?)
- Linear and combinatorial optimization in ordered algebraic structures
- Title not available (Why is that?)
- On the determinization of weighted finite automata
- On the definition of a family of automata
- Title not available (Why is that?)
- Title not available (Why is that?)
- Weak Second‐Order Arithmetic and Finite Automata
- Title not available (Why is that?)
- Title not available (Why is that?)
- An introduction to pseudo-linear algebra
- Title not available (Why is that?)
- Finite Automata Computing Real Functions
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- The Kleene-Schützenberger theorem for formal power series in partially commuting variables.
- Title not available (Why is that?)
- The design principles of a weighted finite-state transducer library
- Title not available (Why is that?)
- Infinite fuzzy computations
- All Infinite Groups are Galois Groups Over any Field
Cited In (20)
- Equational weighted tree transformations with discounting
- ON WEIGHTED BÜCHI AUTOMATA WITH ORDER-COMPLETE WEIGHTS
- Weighted automata with discounting
- Probabilistic Weighted Automata
- Weighted automata and weighted logics with discounting
- On weighted first-order logics with discounting
- Weighted automata and weighted logics
- Valuations of weighted automata: doing it in a rational way
- Weighted automata and regular expressions over valuation monoids
- A Weighted μ-Calculus on Words
- Model checking linear-time properties of probabilistic systems
- Determinization of integral discounted-sum automata is decidable
- On the comparison of discounted-sum automata with multiple discount factors
- Weighted automata
- Regular Expressions on Average and in the Long Run
- Title not available (Why is that?)
- Approximation in description logics: how weighted tree automata can help to define the required concept comparison measures in \(\mathcal {FL}_0\)
- Schützenberger's theorem on formal power series follows from Kleene's theorem
- Weighted LTL with discounting
- Weighted automata and weighted logics on infinite words
This page was built for publication: Skew and infinitary formal power series
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q860889)