Weighted Logics for Nested Words and Algebraic Formal Power Series
From MaRDI portal
Publication:5190325
DOI10.2168/LMCS-6(1:5)2010zbMath1189.68076MaRDI QIDQ5190325
Publication date: 15 March 2010
Published in: Logical Methods in Computer Science (Search for Journal in Brave)
Formal languages and automata (68Q45) Logic in computer science (03B70) Automata and formal grammars in connection with logical questions (03D05) Algebraic theory of languages and automata (68Q70) Specification and verification (program logics, model checking, etc.) (68Q60) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Related Items (6)
WEIGHTED NESTED WORD AUTOMATA AND LOGICS OVER STRONG BIMONOIDS ⋮ Weighted Unranked Tree Automata over Tree Valuation Monoids and Their Characterization by Weighted Logics ⋮ Logics for Weighted Timed Pushdown Automata ⋮ Pebble Weighted Automata and Weighted Logics ⋮ Weighted operator precedence languages ⋮ Weighted automata
This page was built for publication: Weighted Logics for Nested Words and Algebraic Formal Power Series
