scientific article; zbMATH DE number 7561720
From MaRDI portal
Publication:5092440
DOI10.4230/LIPIcs.MFCS.2019.76MaRDI QIDQ5092440
Publication date: 21 July 2022
Full work available at URL: https://arxiv.org/abs/1902.08149
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
first-order logicweighted automataaperiodic automataunambiguousweighted logicfinitely ambiguouspolynomially ambiguous
Related Items (3)
Polynomially ambiguous unary weighted automata over fields ⋮ Quantitative vs. weighted automata ⋮ Register Transducers Are Marble Transducers
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Multi-weighted automata and MSO logic
- Weighted automata and logics for infinite nested words
- MSO logics for weighted timed automata
- Deciding unambiguity and sequentiality from a finitely ambiguous max-plus automaton
- Weighted automata and multi-valued logics over arbitrary bounded lattices
- Handbook of weighted automata
- Weighted automata and weighted logics on infinite words
- Weighted tree automata and weighted logics
- On the degree of ambiguity of finite automata
- Copyless cost-register automata: structure, expressiveness, and closure properties
- Weighted register automata and weighted logic on data words
- 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
- Lexicographic decomposition of \(k\)-valued transducers
- Weighted automata and weighted logics
- Weighted picture automata and weighted logics
- On weighted first-order logics with discounting
- Expressiveness and Closure Properties for Quantitative Languages
- On Finite and Polynomial Ambiguity of Weighted Tree Automata
- Weighted Automata and Logics on Graphs
- Quantitative languages
- Weak Second‐Order Arithmetic and Finite Automata
- On the definition of a family of automata
- A Burnside Approach to the Termination of Mohri's Algorithm for Polynomially Ambiguous Min-Plus-Automata
- Pebble Weighted Automata and Transitive Closure Logics
- Weighted versus Probabilistic Logics
- Decision Problems of Finite Automata Design and Related Arithmetics
- Pebble Weighted Automata and Weighted Logics
- On finite monoids having only trivial subgroups
- Automata, Languages and Programming
This page was built for publication:
