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 (only showing first 100 items - show all)
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
This page was built for publication: Handbook of weighted automata
