Weighted automata and weighted logics

DOI10.1016/j.tcs.2007.02.055zbMath1118.68076OpenAlexW1698854595MaRDI QIDQ2373736

Publication date: 16 July 2007

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2007.02.055

zbMATH Keywords

formal power series weighted automata weighted logics

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05) Algebraic theory of languages and automata (68Q70)

Related Items

Crisp-determinization of weighted tree automata over strong bimonoids, An exercise on the generation of many-valued dynamic logics, Weight Assignment Logic, Weighted automata and weighted logics with discounting, Alternating weighted automata over commutative semirings, Unnamed Item, Definable transductions and weighted logics for texts, Weighted automata and weighted logics on infinite words, Weighted finite automata over strong bimonoids, Weighted Register Automata and Weighted Logic on Data Words, Unnamed Item, Weighted Automata and Weighted Logics, A Logical Characterization of Timed Pushdown Languages, WEIGHTED NESTED WORD AUTOMATA AND LOGICS OVER STRONG BIMONOIDS, Rational elements of summation semirings, McCarthy-Kleene fuzzy automata and MSO logics, Temporal Specifications with Accumulative Values, On quotients of formal power series, Weighted Unranked Tree Automata over Tree Valuation Monoids and Their Characterization by Weighted Logics, Logics for Weighted Timed Pushdown Automata, Weighted automata and weighted MSO logics for average and long-time behaviors, Concurrent weighted logic, A Nivat theorem for weighted picture automata and weighted MSO logics, A Nivat Theorem for Weighted Alternating Automata over Commutative Semirings, Unnamed Item, Weighted Linear Dynamic Logic, Learning Tree Languages, Weighted logics for unranked tree automata, Weighted picture automata and weighted logics, Finite automata theory with membership values in lattices, Weighted Logics for Nested Words and Algebraic Formal Power Series, Quantitative vs. weighted automata, Generalizing input-driven languages: theoretical and practical benefits, Unnamed Item, Unnamed Item, Unnamed Item, Conversion of fuzzy automata into fuzzy regular expressions using transitive closure, On aperiodic and star-free formal power series in partially commuting variables, Weak Second‐Order Arithmetic and Finite Automata, ASP (): Answer Set Programming with Algebraic Constraints, On weighted first-order logics with discounting, A Feferman-Vaught Decomposition Theorem for Weighted MSO Logic., Copyless cost-register automata: structure, expressiveness, and closure properties, Weighted monadic Datalog, Determinization of fuzzy automata with membership values in complete residuated lattices, Multi-weighted automata and MSO logic, Weighted automata and logics for infinite nested words, Weighted modal transition systems, Effective optimization with weighted automata on decomposable trees, A Büchi-like theorem for weighted tree automata over multioperator monoids, Weak MSO with the unbounding quantifier, An Automata View to Goal-Directed Methods, Myhill-Nerode type theory for fuzzy languages and automata, Quantitative Simulation Games, Quantitative analysis of weighted transition systems, Formal power series and regular operations on fuzzy languages, Decidable weighted expressions with Presburger combinators, Unnamed Item, Weighted automata with storage, Weighted register automata and weighted logic on data words, Quantitative simulations by matrices, A Nivat Theorem for Weighted Picture Automata and Weighted MSO Logic, Characterizations of recognizable weighted tree languages by logic and bimorphisms, A unifying survey on weighted logics and weighted automata. Core weighted logic: minimal and versatile specification of quantitative properties, A Kleene-Schützenberger Theorem for Weighted Timed Automata, Weighted Automata and Logics on Infinite Graphs, On Finite and Polynomial Ambiguity of Weighted Tree Automata, On Memoryless Quantitative Objectives, Weighted versus Probabilistic Logics, A Weighted μ-Calculus on Words, Weighted Timed MSO Logics, What's decidable about weighted automata?, Weighted operator precedence languages, Logic for \(\omega\)-pushdown automata, Weighted Tree Automata over Valuation Monoids and Their Characterization by Weighted Logics, How to Tackle Integer Weighted Automata Positivity, Simulation distances, Weighted automata and multi-valued logics over arbitrary bounded lattices, Weighted automata, Monitor Logics for Quantitative Monitor Automata, Weighted Operator Precedence Languages, Measuring and Synthesizing Systems in Probabilistic Environments, THE CHOMSKY-SCHÜTZENBERGER THEOREM FOR QUANTITATIVE CONTEXT-FREE LANGUAGES, A logic-based approach to incremental reasoning on multi-agent systems, Unnamed Item, A robust class of linear recurrence sequences, Characterizing weighted MSO for trees by branching transitive closure logics, A link between multioperator and tree valuation automata and logics

Cites Work