Counting in trees
From MaRDI portal
Recommendations
Cited in
(22)- Query automata over finite trees
- On regular paths with counting and data tests
- Logics for unordered trees with data constraints
- Counting trees using symmetries
- Complexity of modal logics with Presburger constraints
- Reasoning with global assumptions in arithmetic modal logics
- scientific article; zbMATH DE number 1948151 (Why is no real title available?)
- scientific article; zbMATH DE number 1956522 (Why is no real title available?)
- Global numerical constraints on trees
- Verifying quantitative temporal properties of procedural programs
- Automata for unordered trees
- scientific article; zbMATH DE number 269845 (Why is no real title available?)
- Automata, Languages and Programming
- Database Programming Languages
- Term Rewriting and Applications
- Rewriting Techniques and Applications
- Presburger Büchi tree automata with applications to logics with expressive counting
- Validating streaming JSON documents with learned VPAs
- First steps towards taming description logics with strings
- Constraint automata on infinite data trees: from \(\mathrm{CTL}(\mathbb{Z})/\mathrm{CTL}^*(\mathbb{Z})\) to decision procedures
- Constraint automata on infinite data trees: from CTL\((\mathbb{Z})\text{CTL}^*(\mathbb{Z})\) to decision procedures
- Schemas for unordered XML on a DIME
This page was built for publication: Counting in trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3086934)
