FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science

DOI10.1007/B104325MaRDI QIDQ5465875zbMATH OpenOpenAlexFDO

Authors Angelo Montanari, Gabriele Puppis

Publication date 12 August 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b104325

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Automata and formal grammars in connection with logical questions (03D05) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• Regular sets over extended tree structures
• Typed Lambda Calculi and Applications
• Monadic second-order logic on tree-like structures
• The Monadic Theory of Tree-like Structures
• scientific article; zbMATH DE number 1722657

Cited in

(7)

• scientific article; zbMATH DE number 1722657 (Why is no real title available?)
• Determinacy and Rewriting of Top-Down and MSO Tree Transformations
• Transforming structures by set interpretations
• Typed Lambda Calculi and Applications
• FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
• Regular sets over extended tree structures
• The equivalence problem for deterministic MSO tree transducers is decidable

This page was built for publication: FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science

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