Weighted automata and weighted logics
From MaRDI portal
Publication:2373736
Recommendations
Cites work
- Automata theory and its applications
- Automata, Languages and Programming
- Decision Problems of Finite Automata Design and Related Arithmetics
- scientific article; zbMATH DE number 1696660 (Why is no real title available?)
- scientific article; zbMATH DE number 438994 (Why is no real title available?)
- scientific article; zbMATH DE number 3932372 (Why is no real title available?)
- scientific article; zbMATH DE number 41838 (Why is no real title available?)
- scientific article; zbMATH DE number 3497806 (Why is no real title available?)
- scientific article; zbMATH DE number 3588051 (Why is no real title available?)
- scientific article; zbMATH DE number 557977 (Why is no real title available?)
- scientific article; zbMATH DE number 734956 (Why is no real title available?)
- scientific article; zbMATH DE number 1504580 (Why is no real title available?)
- scientific article; zbMATH DE number 1358710 (Why is no real title available?)
- scientific article; zbMATH DE number 941396 (Why is no real title available?)
- scientific article; zbMATH DE number 3368555 (Why is no real title available?)
- On finite monoids having only trivial subgroups
- On the definition of a family of automata
- On the determinization of weighted finite automata
- The design principles of a weighted finite-state transducer library
- THE EQUALITY PROBLEM FOR RATIONAL SERIES WITH MULTIPLICITIES IN THE TROPICAL SEMIRING IS UNDECIDABLE
- Weak Second‐Order Arithmetic and Finite Automata
- Weighted Automata and Weighted Logics on Infinite Words
- Weighted Logics for Traces
- Weighted Picture Automata and Weighted Logics
- Weighted tree automata and weighted logics
Cited in
(only showing first 100 items - show all)- Alternating weighted automata over commutative semirings
- Generalizing input-driven languages: theoretical and practical benefits
- Copyless cost-register automata: structure, expressiveness, and closure properties
- Weighted register automata and weighted logic on data words
- 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
- Weighted automata and weighted MSO logics for average and long-time behaviors
- What's decidable about weighted automata?
- Weighted operator precedence languages
- Logic for \(\omega\)-pushdown automata
- Weighted automata
- A logic-based approach to incremental reasoning on multi-agent systems
- A robust class of linear recurrence sequences
- McCarthy-Kleene fuzzy automata and MSO logics
- Weighted modal transition systems
- Formal power series and regular operations on fuzzy languages
- Weighted automata with storage
- Characterizing weighted MSO for trees by branching transitive closure logics
- A link between multioperator and tree valuation automata and logics
- An exercise on the generation of many-valued dynamic logics
- Advances in weighted logics for artificial intelligence
- A Nivat theorem for weighted picture automata and weighted MSO logics
- Weighted logics for unranked tree automata
- Weighted picture automata and weighted logics
- On weighted first-order logics with discounting
- Determinization of fuzzy automata with membership values in complete residuated lattices
- Rational elements of summation semirings
- On quotients of formal power series
- Quantitative vs. weighted automata
- A Nivat theorem for weighted picture automata and weighted MSO logic
- Weighted automata and logics on infinite graphs
- On finite and polynomial ambiguity of weighted tree automata
- Characterizations of Weighted First-Order Logics over Semirings
- Weighted nested word automata and logics over strong bimonoids
- Weighted automata and logics on graphs
- Temporal specifications with accumulative values
- Weighted unranked tree automata over tree valuation monoids and their characterization by weighted logics
- Weighted Restarting Automata and Pushdown Relations
- Logics for weighted timed pushdown automata
- Learning Tree Languages
- Automata with Auxiliary Weights
- Conversion of fuzzy automata into fuzzy regular expressions using transitive closure
- scientific article; zbMATH DE number 5854944 (Why is no real title available?)
- On memoryless quantitative objectives
- Weighted Tree Automata over Valuation Monoids and Their Characterization by Weighted Logics
- Where automatic structures benefit from weighted automata
- Weighted register automata and weighted logic on data words
- A logical characterization of timed pushdown languages
- Weak Second‐Order Arithmetic and Finite Automata
- Pumping lemmas for weighted automata
- MK-fuzzy automata and MSO logics
- A Büchi-Elgot-Trakhtenbrot theorem for automata with MSO graph storage
- Weight assignment logic
- Weighted Logics for Nested Words and Algebraic Formal Power Series
- Describing average- and longtime-behavior by weighted MSO logics
- Quantitative simulation games
- Weighted Automata and Weighted Logics on Infinite Words
- Weighted versus Probabilistic Logics
- A Weighted μ-Calculus on Words
- Weighted Timed MSO Logics
- How to Tackle Integer Weighted Automata Positivity
- scientific article; zbMATH DE number 2040324 (Why is no real title available?)
- Weighted automata and monadic second order logic
- A Feferman-Vaught Decomposition Theorem for Weighted MSO Logic.
- Weighted linear dynamic logic
- Crisp-determinization of weighted tree automata over strong bimonoids
- Weighted Automata, Formal Power Series and Weighted Logic
- Weighted automata and weighted logics
- scientific article; zbMATH DE number 7561720 (Why is no real title available?)
- Monitor Logics for Quantitative Monitor Automata
- Weighted operator precedence languages
- \(\mathrm{ASP}(\mathcal{AC})\): answer set programming with algebraic constraints
- scientific article; zbMATH DE number 7407779 (Why is no real title available?)
- Descriptive complexity for counting complexity classes
- The Chomsky-Schützenberger theorem for quantitative context-free languages
- Weak MSO with the unbounding quantifier
- Effective optimization with weighted automata on decomposable trees
- Definable Transductions and Weighted Logics for Texts
- KI 2004: Advances in Artificial Intelligence
- A Kleene-Schützenberger Theorem for Weighted Timed Automata
- Measuring and synthesizing systems in probabilistic environments
- Automata, Languages and Programming
- An automata view to goal-directed methods
- Weighted tree generating regular systems over strong bimonoids with reduction semantics
- A Nivat Theorem for Weighted Alternating Automata over Commutative Semirings
- Weighted Linear Dynamic Logic
- Weighted three directions OTA and weighted hexapolic picture automata
- Finite automata theory with membership values in lattices
- Semiring reasoning frameworks in AI and their computational complexity
- Aspmc: new frontiers of algebraic answer set counting
- On polynomial recursive sequences
- Weighted automata and logics meet computational complexity
- A Nivat theorem for weighted alternating automata over commutative semirings
- On polynomial recursive sequences
- A Büchi-like theorem for weighted tree automata over multioperator monoids
- A dynamic temporal logic for quality of service in choreographic models
- Quantitative analysis of weighted transition systems
- Logical characterizations of weighted complexity classes
- Boundedness of cost register automata over the integer min-plus semiring
- Descriptive complexity and weighted Turing machines
This page was built for publication: Weighted automata and weighted logics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2373736)
