First-order definable languages
From MaRDI portal
Recommendations
Cited in
(67)- Algorithmic problems and hierarchies of first-order languages
- Some subsets of monadic first-order logic (MFO) used for the specification and synthesis of -automata
- Some properties of iterated languages
- Regular \(\omega\)-languages with an informative right congruence
- Temporal logic with recursion
- Wheeler languages
- Axiomatizing recursion-free, regular monitors
- Communicating finite-state machines, first-order logic, and star-free propositional dynamic logic
- Boolean algebras of regular languages
- Omega-rational expressions with bounded synchronization delay
- An application of temporal projection to interleaving concurrency
- LTL is closed under topological closure
- Topology, monitorable properties and runtime verification
- On weighted first-order logics with discounting
- Quantitative vs. weighted automata
- Logical aspects of the lexicographic order on 1-counter languages
- Ehrenfeucht-Fraïssé games on omega-terms
- Partially ordered two-way Büchi automata
- Languages of profinite words and the limitedness problem
- scientific article; zbMATH DE number 7447748 (Why is no real title available?)
- A SURVEY ON SMALL FRAGMENTS OF FIRST-ORDER LOGIC OVER FINITE WORDS
- On the expressive power of FO[+]
- scientific article; zbMATH DE number 3926262 (Why is no real title available?)
- Nominal monoids
- scientific article; zbMATH DE number 1261672 (Why is no real title available?)
- scientific article; zbMATH DE number 709536 (Why is no real title available?)
- The covering problem
- Expressiveness and succinctness of a logic of robustness
- Characterizing classes of regular languages using prefix codes of bounded synchronization delay
- Undecidability of satisfiability of expansions of \(\mathrm{FO}[<]\) over words with a \(\mathrm{FO}[+]\)-definable set
- Logical definability on infinite traces
- First-order definability of rational transductions: an algebraic approach
- AN APPLICATION OF FIRST-ORDER LOGIC TO THE STUDY OF RECOGNIZABLE LANGUAGES
- On Existentially First-Order Definable Languages and Their Relation to NP
- scientific article; zbMATH DE number 2102756 (Why is no real title available?)
- It is easy to be wise after the event: communicating finite-state machines capture first-order logic with ``happened before
- Weighted linear dynamic logic
- On canonical models for rational functions over infinite words
- scientific article; zbMATH DE number 7561720 (Why is no real title available?)
- Logical and algebraic characterizations of rational transductions
- Fragments of first-order logic over infinite words
- Fragments of first-order logic over infinite words
- Counter-free automata, first-order logic, and star-free expressions extended by prefix oracles
- Definability in the structure of words with the inclusion relation
- An extension of first order limit language
- \textsc{Pspace}-completeness of the temporal logic of sub-intervals and suffixes
- 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
- First-order separation over countable ordinals
- Constructing the maximum prefix-closed subset for a set of \(-\omega \)-words defined by a \(-\omega \)-regular expression
- Semantics of attack-defense trees for dynamic countermeasures and a new hierarchy of star-free languages
- Bounded fixed-point definability and tabular recognition of languages
- Complementation of - -regular expressions. I
- Automata-theoretic characterisations of branching-time temporal logics
- Efficient normalization of linear temporal logic
- Model checking omega-regular hyperproperties with AutoHyperQ
- HyperLTL satisfiability is highly undecidable, \(\mathrm{HyperCTL}^*\) is even harder
- Star-free languages are Church-Rosser congruential
- First-order logics: some characterizations and closure properties
- Weighted automata and multi-valued logics over arbitrary bounded lattices
- Characterization of -regular languages by first-order formulas
- A survey on the local divisor technique
- Fine hierarchies and m-reducibilities in theoretical computer science
- On regular temporal logics with past
This page was built for publication: First-order definable languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3086925)
