scientific article; zbMATH DE number 3510287
From MaRDI portal
Publication:4090322
Cited in
(30)- The complementation problem for Büchi automata with applications to temporal logic
- Automata-theoretic techniques for modal logics of programs
- Complexity results for classes of quantificational formulas
- Process logic: Expressiveness, decidability, completeness
- Ehrenfeucht games and ordinal addition
- Decision procedures for inductive Boolean functions based on alternating automata
- The complexity of the temporal logic with ``until over general linear time
- Mathematical modal logic: A view of its evolution
- Nested antichains for WS1S
- Logic, semigroups and automata on words
- wMSO theories as grammar formalisms
- A link between multioperator and tree valuation automata and logics
- Bounded-width QBF is PSPACE-complete
- A Kleene theorem and model checking algorithms for existentially bounded communicating automata
- Inverse monoids: decidability and complexity of algebraic questions.
- A logic of reachable patterns in linked data-structures
- Lazy automata techniques for WS1S
- Decidability of the Clark's completion semantics for monadic programs and queries
- An improved lower bound for the elementary theories of trees
- Presburger arithmetic with algebraic scalar multiplications
- A Practical Approach to Courcelle's Theorem
- From Monadic Logic to PSL
- The most nonelementary theory
- Exact complexity bounds for ordinal addition
- On complementation of nondeterministic finite automata without full determinization
- Formal languages and arithmetic theories: recent results and open problems
- On temporal references via definite descriptions in first-order monadic logic of order
- The 1982 ACM Turing Award lecture. An overview of computational complexity
- Logical aspects of Cayley-graphs: the group case
- On decidability properties of local sentences
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4090322)
