Decidable Inequalities over Infinite Trees

DOI10.29007/s21nzbMath1415.68059OpenAlexW2908255398MaRDI QIDQ5222948

Martin Hofmann, Sabine Bauer, Steffen Jost

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 satisfactionregular languageslinear inequalitiespushdown automataresource analysisinfinite treesword combinatorics

Mathematics Subject Classification ID

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

Related Items (3)

ATLAS: automated amortised complexity analysis of self-adjusting data structures ⋮ Two decades of automatic amortized resource analysis ⋮ Type-based analysis of logarithmic amortised complexity

This page was built for publication: Decidable Inequalities over Infinite Trees