Counting in trees for free

DOI10.1007/978-3-540-27836-8_94MaRDI QIDQ5466544zbMATH OpenOpenAlexFDO

Authors Helmut Seidl, Thomas Schwentick, Anca Muscholl, Peter Habermehl

Publication date 24 August 2005

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

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

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Modal logic (including the logic of norms) (03B45) Automata and formal grammars in connection with logical questions (03D05) Database theory (68P15) Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45)

Recommendations

• Counting in trees
• Automata and logics for unranked and unordered trees
• Global numerical constraints on trees
• Automata for unordered trees
• Logics for unordered trees with data constraints

Cited in

(29)

• What's decidable about weighted automata?
• A practical approach to model checking duration calculus using Presburger arithmetic
• Logics for unordered trees with data constraints
• Weighted logics for unranked tree automata
• Context-free commutative grammars with integer counters and resets
• Complexity of modal logics with Presburger constraints
• Temporal specifications with accumulative values
• Counting in trees
• Chain-free string constraints
• Invariant Checking for Programs with Procedure Calls
• Context-Bounded Analysis for Concurrent Programs with Dynamic Creation of Threads
• TAGED Approximations for Temporal Properties Model-Checking
• An approach to multicore parallelism using functional programming: a case study based on Presburger arithmetic
• Global numerical constraints on trees
• Verifying quantitative temporal properties of procedural programs
• Automata for unordered trees
• Extending two-variable logic on data trees with order on data values and its automata
• Logic and branching automata
• Regular Expressions with Counting: Weak versus Strong Determinism
• Presburger Büchi tree automata with applications to logics with expressive counting
• On algebraic array theories
• Succinct ordering and aggregation constraints in algebraic array theories
• Invariants for one-counter automata with disequality tests
• A first taste of MeSCaL, a tool for solving membership problems for regular languages
• An introduction to the theory of linear integer arithmetic (invited paper)
• The complexity of separability for semilinear sets and Parikh automata
• Automata-based verification of programs with tree updates
• XML schema, tree logic and sheaves automata
• Automata for XML -- a survey

This page was built for publication: Counting in trees for free

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