scientific article; zbMATH DE number 1304310
From MaRDI portal
Publication:4251040
zbMath0926.03018MaRDI QIDQ4251040
Publication date: 17 June 1999
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Automata and formal grammars in connection with logical questions (03D05) Classical first-order logic (03B10) Semigroups in automata theory, linguistics, etc. (20M35) Temporal logic (03B44)
Related Items (26)
Pointlike sets and separation: a personal perspective ⋮ Regular languages of thin trees ⋮ Vectorial languages and linear temporal logic ⋮ A note on the characterization of TL [EF] ⋮ Pure future local temporal logics are expressively complete for Mazurkiewicz traces ⋮ Finite-trace linear temporal logic: coinductive completeness ⋮ Unified temporal logic ⋮ Expressiveness and succinctness of a logic of robustness ⋮ Lang-n-Send Extended: Sending Regular Expressions to Monitors ⋮ Aperiodicity, Star-freeness, and First-order Logic Definability of Operator Precedence Languages ⋮ On the translation of automata to linear temporal logic ⋮ First-order separation over countable ordinals ⋮ Automata and logics over finitely varying functions ⋮ Interval vs. Point Temporal Logic Model Checking ⋮ Hierarchies and reducibilities on regular languages related to modulo counting ⋮ The stuttering principle revisited ⋮ Local temporal logic is expressively complete for cograph dependence alphabets ⋮ On Shuffle Ideals ⋮ Characterizing EF and EX tree logics ⋮ Unnamed Item ⋮ On All Things Star-Free ⋮ Varieties ⋮ On relation between linear temporal logic and quantum finite automata ⋮ Merge Decompositions, Two-sided Krohn–Rhodes, and Aperiodic Pointlikes ⋮ Backward Deterministic Büchi Automata on Infinite Words ⋮ LTL is expressively complete for Mazurkiewicz traces
This page was built for publication:
