Weighted Operator Precedence Languages

DOI10.4230/LIPIcs.MFCS.2017.31zbMath1441.68121OpenAlexW2593772604MaRDI QIDQ5111245

Stefan Dück, Matteo Pradella, Dino Mandrioli, Manfred Droste

Publication date: 26 May 2020

Full work available at URL: https://dblp.uni-trier.de/db/conf/mfcs/mfcs2017.html#DrosteDMP17

zbMATH Keywords

quantitative logicquantitative automatavisibly pushdown languagesinput-driven languagesoperator precedence languages

Mathematics Subject Classification ID

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

Related Items

Generalizing input-driven languages: theoretical and practical benefits ⋮ Weighted operator precedence languages ⋮ Weighted automata

Cites Work

• 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
• Handbook of weighted automata
• Weighted tree automata and weighted logics
• Transductions des langages de Chomsky
• Operator precedence and the visibly pushdown property
• 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 Logics for Nested Words and Algebraic Formal Power Series
• Weighted versus Probabilistic Logics
• Decision Problems of Finite Automata Design and Related Arithmetics
• Syntactic Analysis and Operator Precedence
• Parsing Techniques
• Parenthesis Grammars
• Semantics of context-free languages