Handbook of weighted automata
From MaRDI portal
Publication:836989
DOI10.1007/978-3-642-01492-5zbMath1200.68001MaRDI QIDQ836989
No author found.
Publication date: 10 September 2009
Published in: Monographs in Theoretical Computer Science. An EATCS Series (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-01492-5
semirings; weighted automata; weighted logics; weighted discrete structures; weighted recognizability
68Q45: Formal languages and automata
68Q70: Algebraic theory of languages and automata
68-00: General reference works (handbooks, dictionaries, bibliographies, etc.) pertaining to computer science
Related Items
Finitely additive, modular, and probability functions on pre-Semirings, Fuzzy intensional semantics, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, ENUMERATION AND DECIDABLE PROPERTIES OF AUTOMATIC SEQUENCES, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, (f, g)-derivation of ordered Γ-semirings, Unnamed Item, Unnamed Item, On Weighted Petri Net Transducers, Pebble Weighted Automata and Weighted Logics, Unnamed Item, Convolution as a Unifying Concept, Formulae and Asymptotics for Coefficients of Algebraic Functions, Quasi-Distances and Weighted Finite Automata, Measuring and Synthesizing Systems in Probabilistic Environments, Multi-Linear Iterative K-Σ-Semialgebras, On High-Quality Synthesis, Reconstruction of a Labeled Graph by a Graph-walking Mobile Agent, Decidable weighted expressions with Presburger combinators, Computations by fly-automata beyond monadic second-order logic, Minimizing Deterministic Lattice Automata, The complexity of computing the behaviour of lattice automata on infinite trees, Parameterized model checking of weighted networks, Bisimulations for weighted automata over an additively idempotent semiring, On weighted first-order logics with discounting, Nondeterministic finite automata based on quantum logic: language equivalence relation and robustness, Rational elements of summation semirings, Initial-state detectability and initial-state opacity of unambiguous weighted automata, An Efficient Best-Trees Algorithm for Weighted Tree Automata over the Tropical Semiring, Regular Programming for Quantitative Properties of Data Streams, A New Foundation for Finitary Corecursion, Enhancing Automata Learning by Log-Based Metrics, Weighted Automata and Logics on Infinite Graphs, Weighted Symbolic Automata with Data Storage, On Finite and Polynomial Ambiguity of Weighted Tree Automata, Prefix Distance Between Regular Languages, Models for quantitative distributed systems and multi-valued logics, Complexity of Equivalence and Learning for Multiplicity Tree Automata, Modeling Quantitative Aspects of Concurrent Systems Using Weighted Petri Net Transducers, Polynomial Functors Constrained by Regular Expressions, A Program Construction and Verification Tool for Separation Logic, Recurrence Function on Sturmian Words: A Probabilistic Study, Temporal Specifications with Accumulative Values, Learning Weighted Automata, Weighted Unranked Tree Automata over Tree Valuation Monoids and Their Characterization by Weighted Logics, Logics for Weighted Timed Pushdown Automata, Inherent Vacuity in Lattice Automata, Reasoning in Expressive Description Logics under Infinitely Valued Gödel Semantics, Ancient Typefaces and Parametric Weighted Finite Automata, The compositional construction of Markov processes II, Joint Spectral Radius Theory for Automated Complexity Analysis of Rewrite Systems, Regular Expressions on Average and in the Long Run, Weighted Tree Automata over Valuation Monoids and Their Characterization by Weighted Logics, Valuations of Weighted Automata: Doing It in a Rational Way, Unnamed Item, A Truly Concurrent Process Semantics over Multi-Pomsets of Consumable Resources, Weighted Register Automata and Weighted Logic on Data Words, An Algebraic Characterization of Semirings for Which the Support of Every Recognizable Series Is Recognizable, WEIGHTED AUTOMATA AND REGULAR EXPRESSIONS OVER VALUATION MONOIDS, THE CATEGORY OF SIMULATIONS FOR WEIGHTED TREE AUTOMATA, Unnamed Item, Unnamed Item, Weight Assignment Logic, DECOMPOSITION OF WEIGHTED MULTIOPERATOR TREE AUTOMATA, Weighted versus Probabilistic Logics, The Support of a Recognizable Series over a Zero-Sum Free, Commutative Semiring Is Recognizable, A Weighted μ-Calculus on Words, Weighted Timed MSO Logics, A connection between concurrency and language theory, The universal fuzzy automaton, Network-formation games with regular objectives, Weighted finite automata over hemirings, Coping with selfish on-going behaviors, A coalgebraic perspective on linear weighted automata, On algebra of languages representable by vertex-labeled graphs, Modal transition systems with weight intervals, Multi-weighted automata and MSO logic, Structural operational semantics for non-deterministic processes with quantitative aspects, Determinization of fuzzy automata via factorization of fuzzy states, Dynamical systems in categories, Weighted automata and logics for infinite nested words, Algorithms for reasoning in very expressive description logics under infinitely valued Gödel semantics, An improved algorithm for determinization of weighted and fuzzy automata, A Kleene-Schützenberger theorem for weighted timed automata, The compositional construction of Markov processes, Synthesis from component libraries with costs, Quantitative simulations by matrices, Weighted automata and multi-valued logics over arbitrary bounded lattices, Decidability, undecidability, and PSPACE-completeness of the twins property in the tropical semiring, A characterization of rational D0L power series, Matching regular expressions on uncertain data, Integer weighted automata on infinite words, Weighted automata and weighted logics with discounting, Definable transductions and weighted logics for texts, Weighted finite automata over strong bimonoids, Concurrent weighted logic, Convergence of Newton's method over commutative semirings, Weighted monadic Datalog, Determinization of weighted finite automata over strong bimonoids, Alternating weighted automata over commutative semirings, Quantitative monitoring of STL with edit distance, \textsc{ULTraS} at work: compositionality metaresults for bisimulation and trace semantics, Generalization bounds for learning weighted automata, Copyless cost-register automata: structure, expressiveness, and closure properties, Generating permutations with restricted containers, Idempotence of finitely generated commutative semifields, CTL\(^\ast\) with graded path modalities, Weighted register automata and weighted logic on data words, Toward an algebraic theory of systems, A unifying survey on weighted logics and weighted automata. Core weighted logic: minimal and versatile specification of quantitative properties, Weighted restarting automata, On decidability of recursive weighted logics, A generalized partition refinement algorithm, instantiated to language equivalence checking for weighted automata, On deterministic weighted automata, Weighted automata and weighted MSO logics for average and long-time behaviors, On the supports of recognizable series over a field and a single letter alphabet, Better complexity bounds for cost register automata, A unifying approach to algebraic systems over semirings, Non-deterministic weighted automata evaluated over Markov chains, On finite complete rewriting systems, finite derivation type, and automaticity for homogeneous monoids, Weighted automata are compact and actively learnable, Conditions for the existence of maximal factorizations, Finite sequentiality of unambiguous max-plus tree automata, Kleene and Büchi theorems for weighted forest languages over M-monoids, Determinisability of unary weighted automata over the rational numbers, Faster algorithms for quantitative verification in bounded treewidth graphs, Weighted propositional configuration logics: a specification language for architectures with quantitative features, Bisimulation metrics and norms for real-weighted automata, What's decidable about weighted automata?, Weighted automata computation of edit distances with consolidations and fragmentations, Regular transducer expressions for regular transformations, Principal abstract families of weighted tree languages, Weighted operator precedence languages, Automata and rational expressions, Weighted automata, Ambiguity hierarchies for weighted tree automata, Verification of multiplayer stochastic games via abstract dependency graphs, Calibrating generative models: the probabilistic Chomsky-Schützenberger hierarchy, A contribution to the determinization of max-plus automata, McCarthy-Kleene fuzzy automata and MSO logics, Determinization of fuzzy automata by factorizations of fuzzy states and right invariant fuzzy quasi-orders, Approximated determinisation of weighted tree automata, Sequentiality of group-weighted tree automata, Combining semilattices and semimodules, Towards general axiomatizations for bisimilarity and trace semantics, Weighted modal transition systems, Complete proof systems for weighted modal logic, A fixed point theorem for non-monotonic functions, Weighted automata with storage, Capacitated automata and systems, Streamable regular transductions, The relationships among several forms of weighted finite automata over strong bimonoids, A new foundation for finitary corecursion and iterative algebras, Context-free coalgebras, New representations for (max,+) automata with applications to performance evaluation and control of discrete event systems, Characterizing weighted MSO for trees by branching transitive closure logics, Survey: finite-state technology in natural language processing, Model measuring for discrete and hybrid systems, Axiomatizing rational power series over natural numbers, Weighted iterated linear control, Recognizable series on graphs and hypergraphs, On continuous weighted finite automata, Weighted logics for unranked tree automata, Convolution algebras over complete semirings., Some convergence and stability results for two new Kirk type hybrid fixed point iterative algorithms, A note on probabilistic models over strings: the linear algebra approach, Adding pebbles to weighted automata: easy specification \& efficient evaluation, An algebraic characterization of semirings for which the support of every recognizable series is recognizable
