Automata, Languages and Programming

DOI10.1007/b99859zbMath1099.03010OpenAlexW2505584480MaRDI QIDQ5466544

Anca Muscholl, Peter Habermehl, Helmut Seidl, Thomas Schwentick

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

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

Related Items (19)

Automata-based verification of programs with tree updates ⋮ Context-free commutative grammars with integer counters and resets ⋮ Complexity of modal logics with Presburger constraints ⋮ XML schema, tree logic and sheaves automata ⋮ Automata for XML -- a survey ⋮ Temporal Specifications with Accumulative Values ⋮ Weighted logics for unranked tree automata ⋮ On algebraic array theories ⋮ An approach to multicore parallelism using functional programming: a case study based on Presburger arithmetic ⋮ Chain-Free String Constraints ⋮ 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 ⋮ A practical approach to model checking duration calculus using Presburger arithmetic ⋮ Context-Bounded Analysis for Concurrent Programs with Dynamic Creation of Threads ⋮ Regular Expressions with Counting: Weak versus Strong Determinism ⋮ TAGED Approximations for Temporal Properties Model-Checking ⋮ Invariant Checking for Programs with Procedure Calls ⋮ What's decidable about weighted automata?

This page was built for publication: Automata, Languages and Programming