Weighted operator precedence languages
From MaRDI portal
Publication:2064530
DOI10.1016/j.ic.2020.104658zbMath1483.68162arXiv1702.04597OpenAlexW3109871652MaRDI QIDQ2064530
Matteo Pradella, Stefan Dück, Manfred Droste, Dino Mandrioli
Publication date: 6 January 2022
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1702.04597
quantitative logicquantitative automatavisibly pushdown languagesinput-driven languagesoperator precedence languages
Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Weighted automata and logics for infinite nested words
- First-order logics: some characterizations and closure properties
- Weighted automata and multi-valued logics over arbitrary bounded lattices
- Handbook of weighted automata
- Weighted tree automata and weighted logics
- Transductions des langages de Chomsky
- Operator precedence and the visibly pushdown property
- 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
- Weighted automata and weighted logics
- Characterizing derivation trees of context-free grammars through a generalization of finite automata theory
- Colored Nested Words
- WEIGHTED NESTED WORD AUTOMATA AND LOGICS OVER STRONG BIMONOIDS
- Operator Precedence Languages: Their Automata-Theoretic and Logic Characterization
- Weighted Unranked Tree Automata over Tree Valuation Monoids and Their Characterization by Weighted Logics
- Weak Second‐Order Arithmetic and Finite Automata
- On the definition of a family of automata
- Adding nesting structure to words
- Weighted versus Probabilistic Logics
- Decision Problems of Finite Automata Design and Related Arithmetics
- Algebraic properties of operator precedence languages
- Weighted Operator Precedence Languages
- A Nivat Theorem for Weighted Timed Automata and Weighted Relative Distance Logic
- Weighted Logics for Nested Words and Algebraic Formal Power Series
- RECOGNIZABLE AND LOGICALLY DEFINABLE LANGUAGES OF INFINITE COMPUTATIONS IN CONCURRENT AUTOMATA
- Syntactic Analysis and Operator Precedence
- Some properties of precedence languages
- Parenthesis Grammars
- Semantics of context-free languages
This page was built for publication: Weighted operator precedence languages
