scientific article; zbMATH DE number 7561720
From MaRDI portal
Publication:5092440
Recommendations
- Weighted automata and weighted logics
- Weighted automata and weighted logics
- Automata, Languages and Programming
- Weighted automata and monadic second order logic
- Weighted automata and weighted logics on infinite words
- Weighted Automata and Weighted Logics on Infinite Words
- Weighted Automata, Formal Power Series and Weighted Logic
- Weighted tree automata and weighted logics
- Weighted automata and logics on graphs
- Pebble weighted automata and weighted logics
Cites work
- A Burnside Approach to the Termination of Mohri's Algorithm for Polynomially Ambiguous Min-Plus-Automata
- A unifying survey on weighted logics and weighted automata. Core weighted logic: minimal and versatile specification of quantitative properties
- Automata, Languages and Programming
- Copyless cost-register automata: structure, expressiveness, and closure properties
- Deciding unambiguity and sequentiality from a finitely ambiguous max-plus automaton
- Decision Problems of Finite Automata Design and Related Arithmetics
- Elements of automata theory. Translated from the French by Reuben Thomas
- Expressiveness and closure properties for quantitative languages
- First-order definable languages
- Handbook of weighted automata
- scientific article; zbMATH DE number 3932372 (Why is no real title available?)
- scientific article; zbMATH DE number 3978429 (Why is no real title available?)
- scientific article; zbMATH DE number 41838 (Why is no real title available?)
- scientific article; zbMATH DE number 3588051 (Why is no real title available?)
- scientific article; zbMATH DE number 3368555 (Why is no real title available?)
- Lexicographic decomposition of \(k\)-valued transducers
- MSO logics for weighted timed automata
- On finite and polynomial ambiguity of weighted tree automata
- On finite monoids having only trivial subgroups
- On the definition of a family of automata
- On the degree of ambiguity of finite automata
- On weighted first-order logics with discounting
- Pebble weighted automata and transitive closure logics
- Pebble weighted automata and weighted logics
- Pumping lemmas for weighted automata
- Quantitative languages
- Weak Second‐Order Arithmetic and Finite Automata
- Weighted automata and logics on graphs
- Weighted automata and multi-valued logics over arbitrary bounded lattices
- Weighted automata and weighted logics
- Weighted automata and weighted logics on infinite words
- Weighted automata and weighted MSO logics for average and long-time behaviors
- Weighted picture automata and weighted logics
- Weighted register automata and weighted logic on data words
- Weighted tree automata and weighted logics
- Weighted versus Probabilistic Logics
Cited in
(7)- Quantitative vs. weighted automata
- Weighted Automata, Formal Power Series and Weighted Logic
- Register Transducers Are Marble Transducers
- Polynomially ambiguous unary weighted automata over fields
- Finitely ambiguous and finitely sequential weighted automata over fields
- Finite sequentiality of finitely ambiguous max-plus tree automata
- Weighted automata and logics meet computational complexity
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5092440)
