Weighted operator precedence languages

DOI10.4230/LIPICS.MFCS.2017.31MaRDI QIDQ5111245zbMATH OpenOpenAlexFDO

Authors Stefan Dück, Dino Mandrioli, Matteo Pradella, 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)

Recommendations

• Weighted operator precedence languages
• Operator precedence \(\omega \)-languages
• Operator precedence languages: their automata-theoretic and logic characterization
• Higher-order operator precedence languages
• Beyond operator-precedence grammars and languages

Cites work

• scientific article; zbMATH DE number 3876636 (Why is no real title available?)
• scientific article; zbMATH DE number 3932372 (Why is no real title available?)
• scientific article; zbMATH DE number 3696500 (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 1142326 (Why is no real title available?)
• scientific article; zbMATH DE number 2079028 (Why is no real title available?)
• scientific article; zbMATH DE number 3368555 (Why is no real title available?)
• Adding nesting structure to words
• Characterizing derivation trees of context-free grammars through a generalization of finite automata theory
• Colored Nested Words
• Decision Problems of Finite Automata Design and Related Arithmetics
• First-order logics: some characterizations and closure properties
• Handbook of weighted automata
• On the definition of a family of automata
• Operator precedence languages: their automata-theoretic and logic characterization
• Operator precedence and the visibly pushdown property
• Parenthesis Grammars
• Parsing Techniques
• Semantics of context-free languages
• Syntactic Analysis and Operator Precedence
• Transductions des langages de Chomsky
• Weak Second‐Order Arithmetic and Finite Automata
• Weighted Logics for Nested Words and Algebraic Formal Power Series
• Weighted automata and weighted MSO logics for average and long-time behaviors
• Weighted automata and weighted logics
• Weighted nested word automata and logics over strong bimonoids
• Weighted tree automata and weighted logics
• Weighted unranked tree automata over tree valuation monoids and their characterization by weighted logics
• Weighted versus Probabilistic Logics

Cited in

(4)

• Operator precedence \(\omega \)-languages
• Weighted operator precedence languages
• Weighted automata
• Generalizing input-driven languages: theoretical and practical benefits

This page was built for publication: Weighted operator precedence languages

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5111245)