From LP formulas of the form F(t) to - -regular expressions

DOI10.1007/S10559-020-00286-XzbMATH Open1477.68149OpenAlexW3090925833MaRDI QIDQ2215841FDOQ2215841

Authors A. N. Chebotarev

Publication date 14 December 2020

Published in Cybernetics and Systems Analysis (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10559-020-00286-x

zbMATH Keywords

left-infinite word\(-\omega \)-regular expressionlogic LPprefix-closed set of left-infinite wordsright-bounded formula

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05)

Recommendations

• Synthesis of \(\Sigma\)-automata specified in the first order logical languages LP and LF
• Problems of synthesis of \(\Sigma\)-automata specified in languages LP and LF of first order logic
• Extension of the automaton specification logical language and the synthesis problem
• Characterization of \(\omega\)-regular languages by first-order formulas
• Intersection of \(-\omega \)-regular expressions

Cites work

• A theory of ultimately periodic languages and automata with an application to time granularity
• Detecting fictitious states in a \(\Sigma \)-automaton synthesized from its specification in the language LP
• On the expressive power of temporal logic for infinite words
• Synthesis of \(\Sigma\)-automata specified in the first order logical languages LP and LF
• Verification of reactive systems. Formal methods and algorithms.

Cited in

(1)

• Constructing a \(-\omega\)-regular expression specified by a graph of elementary extensions

This page was built for publication: From LP formulas of the form \(F(t)\) to \(-\omega \)-regular expressions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2215841)