Weighted Operator Precedence Languages

DOI10.4230/LIPICS.MFCS.2017.31zbMATH Open1441.68121OpenAlexW2593772604MaRDI QIDQ5111245FDOQ5111245

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

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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Handbook of weighted automata
• Adding nesting structure to words
• On the definition of a family of automata
• Parenthesis Grammars
• Weak Second‐Order Arithmetic and Finite Automata
• Decision Problems of Finite Automata Design and Related Arithmetics
• Semantics of context-free languages
• Weighted versus Probabilistic Logics
• Characterizing derivation trees of context-free grammars through a generalization of finite automata theory
• Parsing Techniques
• First-order logics: some characterizations and closure properties
• 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 Logics for Nested Words and Algebraic Formal Power Series
• Weighted automata and logics for infinite nested words
• Weighted tree automata and weighted logics
• Transductions des langages de Chomsky
• Syntactic Analysis and Operator Precedence
• Operator precedence and the visibly pushdown property
• Operator Precedence Languages: Their Automata-Theoretic and Logic Characterization
• Colored Nested Words
• Weighted Unranked Tree Automata over Tree Valuation Monoids and Their Characterization by Weighted Logics

Cited In (3)

• 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)