Constructing a --regular expression specified by a graph of elementary extensions

DOI10.1007/S10559-022-00447-0MaRDI QIDQ2103759zbMATH OpenOpenAlexFDO

Authors A. N. Chebotarev

Publication date 9 December 2022

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

Full work available at URL https://doi.org/10.1007/s10559-022-00447-0

zbMATH Keywords

\( -\omega \)-regular expression\( \omega \)-wordgraph of elementary extensionslinear equations over \( -\omega \)-regular setsprefix-closed set of \( -\omega \)-words

Mathematics Subject Classification ID

Theory of computing (68Qxx) Computability and recursion theory (03Dxx)

Recommendations

• From LP formulas of the form F(t) to - -regular expressions
• Intersection of \(-\omega \)-regular expressions
• Transformation between regular expressions and \(\omega\)-automata
• Synthesis of \(\Sigma\)-automata specified in the first order logical languages LP and LF
• scientific article; zbMATH DE number 1159571

Cites work

• From LP formulas of the form F(t) to - -regular expressions
• From \(\omega\)-regular expressions to Büchi automata via partial derivatives
• Intersection of \(-\omega \)-regular expressions

Cited in

(2)

• Constructing the maximum prefix-closed subset for a set of \(-\omega \)-words defined by a \(-\omega \)-regular expression
• Intersection of \(-\omega \)-regular expressions

This page was built for publication: Constructing a \(-\omega\)-regular expression specified by a graph of elementary extensions

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