scientific article; zbMATH DE number 3510287
From MaRDI portal
Publication:4090322
zbMath0326.02036MaRDI QIDQ4090322
Publication date: 1975
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Automata and formal grammars in connection with logical questions (03D05) Decidability of theories and sets of sentences (03B25) Turing machines and related notions (03D10)
Related Items
The complementation problem for Büchi automata with applications to temporal logic ⋮ Automata-theoretic techniques for modal logics of programs ⋮ Inverse monoids: decidability and complexity of algebraic questions. ⋮ A logic of reachable patterns in linked data-structures ⋮ On decidability properties of local sentences ⋮ The most nonelementary theory ⋮ Ehrenfeucht games and ordinal addition ⋮ Decidability of the Clark's completion semantics for monadic programs and queries ⋮ Decision procedures for inductive Boolean functions based on alternating automata ⋮ The complexity of the temporal logic with ``until over general linear time ⋮ Complexity results for classes of quantificational formulas ⋮ Mathematical modal logic: A view of its evolution ⋮ Process logic: Expressiveness, decidability, completeness ⋮ Bounded-width QBF is PSPACE-complete ⋮ Nested antichains for WS1S ⋮ Lazy Automata Techniques for WS1S ⋮ Exact complexity bounds for ordinal addition ⋮ An improved lower bound for the elementary theories of trees ⋮ A Practical Approach to Courcelle's Theorem ⋮ Logical aspects of Cayley-graphs: the group case ⋮ A Kleene theorem and model checking algorithms for existentially bounded communicating automata ⋮ From Monadic Logic to PSL ⋮ Logic, semigroups and automata on words ⋮ Unnamed Item ⋮ A link between multioperator and tree valuation automata and logics ⋮ wMSO theories as grammar formalisms
