scientific article
From MaRDI portal
Publication:3086925
zbMath1234.03024MaRDI QIDQ3086925
Publication date: 30 March 2011
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (35)
Axiomatizing recursion-free, regular monitors ⋮ An application of temporal projection to interleaving concurrency ⋮ Expressiveness and succinctness of a logic of robustness ⋮ Characterizing classes of regular languages using prefix codes of bounded synchronization delay ⋮ \textsc{Pspace}-completeness of the temporal logic of sub-intervals and suffixes ⋮ A survey on the local divisor technique ⋮ Positive First-order Logic on Words and Graphs ⋮ Aperiodicity, Star-freeness, and First-order Logic Definability of Operator Precedence Languages ⋮ Representing regular languages of infinite words using mod 2 multiplicity automata ⋮ Weighted Linear Dynamic Logic ⋮ On the translation of automata to linear temporal logic ⋮ Constructing the maximum prefix-closed subset for a set of \(-\omega \)-words defined by a \(-\omega \)-regular expression ⋮ Unnamed Item ⋮ Quantitative vs. weighted automata ⋮ Communicating finite-state machines, first-order logic, and star-free propositional dynamic logic ⋮ Unnamed Item ⋮ Some subsets of monadic first-order logic (MFO) used for the specification and synthesis of \(\Sigma\)-automata ⋮ Unnamed Item ⋮ LTL is closed under topological closure ⋮ Topology, monitorable properties and runtime verification ⋮ On weighted first-order logics with discounting ⋮ Fine hierarchies and m-reducibilities in theoretical computer science ⋮ Fragments of first-order logic over infinite words ⋮ Some properties of iterated languages ⋮ On regular temporal logics with past ⋮ Star-free languages are Church-Rosser congruential ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Regular \(\omega\)-languages with an informative right congruence ⋮ Unnamed Item ⋮ Temporal logic with recursion ⋮ Wheeler languages ⋮ Weighted automata and multi-valued logics over arbitrary bounded lattices ⋮ Boolean algebras of regular languages ⋮ Omega-rational expressions with bounded synchronization delay
This page was built for publication:
