Weighted Logics for Nested Words and Algebraic Formal Power Series
DOI10.1007/978-3-540-70583-3_19zbMath1156.68037arXiv1001.2175OpenAlexW1571963071MaRDI QIDQ3519504
Publication date: 19 August 2008
Published in: Automata, Languages and Programming (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1001.2175
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 (17)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Weighted tree automata and weighted logics
- Monadic second-order definable graph transductions: a survey
- Weighted automata and weighted logics
- Weighted Logics for Traces
- Visibly pushdown languages
- Adding Nesting Structure to Words
- Weighted Automata and Weighted Logics on Infinite Words
- Definable Transductions and Weighted Logics for Texts
- Regular Languages of Nested Words: Fixed Points, Automata, and Synchronization
- Weighted Picture Automata and Weighted Logics
- Automata, Languages and Programming
This page was built for publication: Weighted Logics for Nested Words and Algebraic Formal Power Series