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

DOI10.1007/s10559-023-00623-wOpenAlexW4389334461MaRDI QIDQ6198088

Anatoli N. Chebotarev

Publication date: 20 February 2024

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

Full work available at URL: https://doi.org/10.1007/s10559-023-00623-w

zbMATH Keywords

\(-\omega \)-regular expressiongraph of elementary extensions\(-\omega \)-wordlinear equation over \(-\omega \)-regular setsprefix-closed set of \(-\omega \)-words

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Learning regular omega languages
• Synthesis of \(\Sigma\)-automata specified in the first order logical languages LP and LF
• Intersection of \(-\omega \)-regular expressions
• Constructing a \(-\omega\)-regular expression specified by a graph of elementary extensions
• From $$\omega $$-Regular Expressions to Büchi Automata via Partial Derivatives
• Star-free regular sets of ω-sequences
• Ultimately periodic words of rational ω-languages

This page was built for publication: Constructing the maximum prefix-closed subset for a set of \(-\omega \)-words defined by a \(-\omega \)-regular expression