Decidable inequalities over infinite trees

DOI10.29007/S21NMaRDI QIDQ5222948zbMATH OpenOpenAlexFDO

Authors Sabine Bauer, Steffen Jost, Martin Hofmann

Publication date 4 July 2019

Published in EPiC Series in Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.29007/s21n

zbMATH Keywords

constraint satisfactioninfinite treeslinear inequalitiespushdown automataregular languagesresource analysisword combinatorics

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Automata and formal grammars in connection with logical questions (03D05) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Combinatorics on words (68R15)

Recommendations

• Linear constraints over infinite trees
• Decidable linear list constraints
• Finite and Rational Tree Constraints
• Equational and membership constraints for infinite trees
• Expressiveness of full first-order constraints in the algebra of finite or infinite trees

Cited in

(11)

• Linear constraints over infinite trees
• scientific article; zbMATH DE number 6680130 (Why is no real title available?)
• scientific article; zbMATH DE number 3917747 (Why is no real title available?)
• Decidable linear list constraints
• Equational and membership constraints for infinite trees
• scientific article; zbMATH DE number 3894467 (Why is no real title available?)
• The Computable Dimension of I-Trees of Infinite Height
• Two decades of automatic amortized resource analysis
• Type-based analysis of logarithmic amortised complexity
• Choice functions and well-orderings over the infinite binary tree
• ATLAS: automated amortised complexity analysis of self-adjusting data structures

This page was built for publication: Decidable inequalities over infinite trees

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