Handbook of weighted automata
From MaRDI portal
Publication:836989
DOI10.1007/978-3-642-01492-5zbMath1200.68001OpenAlexW1643571618MaRDI 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
Formal languages and automata (68Q45) Algebraic theory of languages and automata (68Q70) General reference works (handbooks, dictionaries, bibliographies, etc.) pertaining to computer science (68-00)
Related Items
A connection between concurrency and language theory, Learning infinite-word automata with loop-index queries, The universal fuzzy automaton, Matching regular expressions on uncertain data, Integer weighted automata on infinite words, Finite-image property of weighted tree automata over past-finite monotonic strong bimonoids, Model measuring for discrete and hybrid systems, Weighted automata and weighted logics with discounting, Alternating weighted automata over commutative semirings, Definable transductions and weighted logics for texts, Weighted finite automata over strong bimonoids, Gradient-descent for randomized controllers under partial observability, Network-formation games with regular objectives, Symbolic weighted language models, quantitative parsing and automated music transcription, An ambiguity hierarchy of weighted context-free grammars, Quantitative monitoring of STL with edit distance, Calibrating generative models: the probabilistic Chomsky-Schützenberger hierarchy, A contribution to the determinization of max-plus automata, Weighted finite automata over hemirings, McCarthy-Kleene fuzzy automata and MSO logics, \textsc{ULTraS} at work: compositionality metaresults for bisimulation and trace semantics, Weighted automata and weighted MSO logics for average and long-time behaviors, Concurrent weighted logic, Convergence of Newton's method over commutative semirings, Coping with selfish on-going behaviors, A coalgebraic perspective on linear weighted automata, On algebra of languages representable by vertex-labeled graphs, On the supports of recognizable series over a field and a single letter alphabet, A Kleene-Schützenberger theorem for weighted timed automata, Determinization of fuzzy automata by factorizations of fuzzy states and right invariant fuzzy quasi-orders, The compositional construction of Markov processes, Generalization bounds for learning weighted automata, Modal transition systems with weight intervals, Approximated determinisation of weighted tree automata, Sequentiality of group-weighted tree automata, Combining semilattices and semimodules, Copyless cost-register automata: structure, expressiveness, and closure properties, Weighted monadic Datalog, Towards general axiomatizations for bisimilarity and trace semantics, 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, Generating permutations with restricted containers, Dynamical systems in categories, Weighted automata and logics for infinite nested words, Synthesis from component libraries with costs, Algorithms for reasoning in very expressive description logics under infinitely valued Gödel semantics, Weighted modal transition systems, Idempotence of finitely generated commutative semifields, Better complexity bounds for cost register automata, A unifying approach to algebraic systems over semirings, Complete proof systems for weighted modal logic, A fixed point theorem for non-monotonic functions, An improved algorithm for determinization of weighted and fuzzy automata, Non-deterministic weighted automata evaluated over Markov chains, On finite complete rewriting systems, finite derivation type, and automaticity for homogeneous monoids, CTL\(^\ast\) with graded path modalities, Determinization of weighted finite automata over strong bimonoids, Weighted automata with storage, Capacitated automata and systems, Weighted register automata and weighted logic on data words, Toward an algebraic theory of systems, Weighted automata are compact and actively learnable, Quantitative simulations by matrices, Conditions for the existence of maximal factorizations, Streamable regular transductions, 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, The relationships among several forms of weighted finite automata over strong bimonoids, Finite sequentiality of unambiguous max-plus tree automata, Kleene and Büchi theorems for weighted forest languages over M-monoids, A new foundation for finitary corecursion and iterative algebras, 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, 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, Automata and rational expressions, Weighted automata, On some decidability questions concerning supports of rational series, Disambiguation of weighted tree automata, Image-binary automata, Finite ambiguity and finite sequentiality in weighted automata over fields, Context-free coalgebras, A robust class of linear recurrence sequences, 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, Ambiguity hierarchies for weighted tree automata, Survey: finite-state technology in natural language processing, Verification of multiplayer stochastic games via abstract dependency graphs, Coalgebras for Bisimulation of Weighted Automata over Semirings, Polynomially ambiguous unary weighted automata over fields, Combinatory categorial grammars as generators of weighted forests, Ambiguity Hierarchies for Weighted Tree Automata, Algorithms for Probabilistic and Stochastic Subsequential Failure Transducers, Modelling Uncertainty in Architectures of Parametric Component-Based Systems, Decidability Boundaries for the Finite-Image Property of Weighted Finite Automata, On the arithmetic of polynomial semidomains, Fuzzy \(\epsilon\)-approximate regular languages and minimal deterministic fuzzy automata \(\epsilon\)-accepting them, On the Verification of Weighted Kripke Structures Under Uncertainty, Weighted propositional configuration logic over De Morgan algebras, Weighted two-way transducers, A formal algebraic approach for the quantitative modeling of connectors in architectures, Bideterministic weighted automata, The net automaton of a rational expression, Weighted two-way transducers, The Complexity of Aggregates over Extractions by Regular Expressions, A Nivat Theorem for Weighted Alternating Automata over Commutative Semirings, Back to the format: a survey on SOS for probabilistic processes, Equivalence, Unambiguity, and Sequentiality of Finitely Ambiguous Max-Plus Tree Automata, A Comparison of Sets of Recognizable Weighted Tree Languages Over Specific Sets of Bounded Lattices, Weighted Linear Dynamic Logic, Bideterministic weighted automata, Foundations of graph path query languages. Course notes for the reasoning web summer school 2021, Integer Weighted Automata on Infinite Words, Unnamed Item, Up-to techniques for behavioural metrics via fibrations, Tree-Based Generation of Restricted Graph Languages, Pumping Lemmata for Recognizable Weighted Languages over Artinian Semirings, \(\mathrm{GF}(2)\)-operations on basic families of formal languages, An ambiguity hierarchy of weighted context-free grammars, Decidable weighted expressions with Presburger combinators, Computations by fly-automata beyond monadic second-order logic, Minimizing Deterministic Lattice Automata, Convolution as a Unifying Concept, Crisp-determinization of weighted tree automata over strong bimonoids, Morphisms and Minimisation of Weighted Automata, Weight Assignment Logic, Unnamed Item, A Truly Concurrent Process Semantics over Multi-Pomsets of Consumable Resources, Weighted Register Automata and Weighted Logic on Data Words, Convexity via Weak Distributive Laws, An Algebraic Characterization of Semirings for Which the Support of Every Recognizable Series Is Recognizable, Axiomatizing rational power series over natural numbers, Unnamed Item, Complexity of Equivalence and Learning for Multiplicity Tree Automata, Nondeterministic finite automata based on quantum logic: language equivalence relation and robustness, Convolution and concurrency, Rational elements of summation semirings, Finitely additive, modular, and probability functions on pre-Semirings, Initial-state detectability and initial-state opacity of unambiguous weighted 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, Greibach normal form for \(\omega\)-algebraic systems and weighted simple \(\omega\)-pushdown automata, On quotients of formal power series, 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, WEIGHTED AUTOMATA AND REGULAR EXPRESSIONS OVER VALUATION MONOIDS, THE CATEGORY OF SIMULATIONS FOR WEIGHTED TREE AUTOMATA, Weighted iterated linear control, Recognizable series on graphs and hypergraphs, Unnamed Item, Catoids and modal convolution algebras, On continuous weighted finite automata, Weighted logics for unranked tree automata, Reasoning in Expressive Description Logics under Infinitely Valued Gödel Semantics, Formulae and Asymptotics for Coefficients of Algebraic Functions, Unnamed Item, Unnamed Item, Unnamed Item, Convolution algebras over complete semirings., Unnamed Item, Unnamed Item, 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, 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, Unnamed Item, Unnamed Item, On weighted first-order logics with discounting, Ancient Typefaces and Parametric Weighted Finite Automata, The compositional construction of Markov processes II, Up-To Techniques for Behavioural Metrics via Fibrations, ENUMERATION AND DECIDABLE PROPERTIES OF AUTOMATIC SEQUENCES, Non-deterministic Weighted Automata on Random Words, Fuzzy intensional semantics, Joint Spectral Radius Theory for Automated Complexity Analysis of Rewrite Systems, On Weighted Petri Net Transducers, Pebble Weighted Automata and Weighted Logics, Multi-Linear Iterative K-Σ-Semialgebras, On High-Quality Synthesis, Reconstruction of a Labeled Graph by a Graph-walking Mobile Agent, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, An Efficient Best-Trees Algorithm for Weighted Tree Automata over the Tropical Semiring, Regular Programming for Quantitative Properties of Data Streams, Regular Expressions on Average and in the Long Run, Unnamed Item, 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, Unnamed Item, DECOMPOSITION OF WEIGHTED MULTIOPERATOR TREE AUTOMATA, Quasi-Distances and Weighted Finite 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, Weighted Tree Automata over Valuation Monoids and Their Characterization by Weighted Logics, Valuations of Weighted Automata: Doing It in a Rational Way, Prefix Distance Between Regular Languages, (f, g)-derivation of ordered Γ-semirings, Monitor Logics for Quantitative Monitor Automata, Weighted Operator Precedence Languages, Bidirectional nested weighted automata, Measuring and Synthesizing Systems in Probabilistic Environments, Unnamed Item, Models for quantitative distributed systems and multi-valued logics, Better complexity bounds for cost register automata, Improved algorithms for computing the greatest right and left invariant Boolean matrices and their application
