Weighted automata
From MaRDI portal
Publication:2074206
DOI10.4171/Automata-1/4OpenAlexW4200399670MaRDI QIDQ2074206
Dietrich Kuske, Manfred Droste
Publication date: 4 February 2022
Full work available at URL: https://doi.org/10.4171/automata-1/4
Related Items (14)
Coalgebras for Bisimulation of Weighted Automata over Semirings ⋮ Weight Assignment Logic ⋮ Polynomially ambiguous unary weighted automata over fields ⋮ Decidability Boundaries for the Finite-Image Property of Weighted Finite Automata ⋮ Bideterministic weighted automata ⋮ A Comparison of Sets of Recognizable Weighted Tree Languages Over Specific Sets of Bounded Lattices ⋮ Weighted Linear Dynamic Logic ⋮ Bideterministic weighted automata ⋮ Pumping Lemmata for Recognizable Weighted Languages over Artinian Semirings ⋮ A Nivat Theorem for Weighted Picture Automata and Weighted MSO Logic ⋮ Determinisability of unary weighted automata over the rational numbers ⋮ Unambiguity in Automata Theory ⋮ On some decidability questions concerning supports of rational series ⋮ Finite ambiguity and finite sequentiality in weighted automata over fields
Uses Software
Cites Work
- 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
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Weighted finite automata over hemirings
- Weighted automata and logics for infinite nested words
- MSO logics for weighted timed automata
- Optimal paths in weighted timed automata
- A Kleene-Schützenberger theorem for weighted timed automata
- T-structures, T-functions, and texts
- Automata-based axiom pinpointing
- Weighted automata and multi-valued logics over arbitrary bounded lattices
- Recursive unsolvability of Post's problem of Tag und other topics in theory of Turing machines
- The equivalence problem of multitape finite automata
- Handbook of weighted automata
- Weighted automata and weighted logics with discounting
- Definable transductions and weighted logics for texts
- Skew and infinitary formal power series
- Improved limitedness theorems on finite automata with distance functions
- Effective construction of the syntactic algebra of a recognizable series on trees
- On aperiodic and star-free formal power series in partially commuting variables
- Schützenberger's theorem on formal power series follows from Kleene's theorem
- On cancellation properties of languages which are supports of rational power series
- Recognizable formal power series on trees
- Classifying regular events in symbolic logic
- Transductions des langages de Chomsky
- Matrices de Hankel
- On some questions of rationality and decidability
- Metamathematics of fuzzy logic
- Finite tree automata with cost functions
- Finite-memory automata
- Monadic second-order definable text languages
- Weighted register automata and weighted logic on data words
- Monadic second-order logic over rectangular pictures and recognizability by tiling systems
- Weighted automata and weighted MSO logics for average and long-time behaviors
- Computer science -- theory and applications. 8th international computer science symposium in Russia, CSR 2013, Ekaterinburg, Russia, June 25--29, 2013. Proceedings
- Weighted automata and weighted logics
- A Nivat theorem for weighted picture automata and weighted MSO logics
- Weighted logics for unranked tree automata
- Weighted picture automata and weighted logics
- An algebraic characterization of semirings for which the support of every recognizable series is recognizable
- Optimal infinite scheduling for multi-priced timed automata
- Recent advances in formal languages and applications.
- Expressiveness and Closure Properties for Quantitative Languages
- Weighted Automata and Logics on Infinite Graphs
- Conway and iteration hemirings Part 2
- The Support of a Recognizable Series over a Zero-sum Free, Commutative Semiring is Recognizable
- Operator Precedence Languages: Their Automata-Theoretic and Logic Characterization
- Weighted Automata and Logics on Graphs
- Quantitative languages
- A Unifying Kleene Theorem for Weighted Finite Automata
- Valuations of Weighted Automata: Doing It in a Rational Way
- What’s Decidable about Weighted Automata?
- WEIGHTED AUTOMATA AND REGULAR EXPRESSIONS OVER VALUATION MONOIDS
- On the definition of a family of automata
- Adding nesting structure to words
- OpenFst: A General and Efficient Weighted Finite-State Transducer Library
- Infinite Runs in Weighted Timed Automata with Energy Constraints
- Automatic Termination
- Weighted versus Probabilistic Logics
- Decision Problems of Finite Automata Design and Related Arithmetics
- Finite Automata Computing Real Functions
- THE EQUALITY PROBLEM FOR RATIONAL SERIES WITH MULTIPLICITIES IN THE TROPICAL SEMIRING IS UNDECIDABLE
- Weighted Automata Algorithms
- Algebraic Systems and Pushdown Automata
- Traces, Series-Parallel Posets, and Pictures: A Weighted Study
- Applications of Weighted Automata in Natural Language Processing
- Weighted Operator Precedence Languages
- A Nivat Theorem for Weighted Timed Automata and Weighted Relative Distance Logic
- Pebble Weighted Automata and Weighted Logics
- Weighted Logics for Nested Words and Algebraic Formal Power Series
- The Chomsky-Schützenberger Theorem for Quantitative Context-Free Languages
- Distance desert automata and the star height problem
- On finite monoids having only trivial subgroups
- Lattice Automata
- Automata, Languages and Programming
- Tiburon: A Weighted Tree Automata Toolkit
- Automata theory and its applications
This page was built for publication: Weighted automata
