Intersection of \(-\omega \)-regular expressions

DOI10.1007/s10559-021-00393-3zbMath1484.68078OpenAlexW3204297081MaRDI QIDQ2058685

Anatoli N. Chebotarev

Publication date: 9 December 2021

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

Full work available at URL: https://doi.org/10.1007/s10559-021-00393-3

zbMATH Keywords

left-infinite word*-expansion\(-\omega \)-expansion\(-\omega \)-regular expressionsimple \(-\omega \)-regular expressiontree of intersections

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (2)

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

Cites Work

• Unnamed Item
• Unnamed Item
• Synthesis of \(\Sigma\)-automata specified in the first order logical languages LP and LF
• Detecting fictitious states in a \(\Sigma \)-automaton synthesized from its specification in the language LP
• From $$\omega $$-Regular Expressions to Büchi Automata via Partial Derivatives
• Finite-State Automata on Infinite Inputs

This page was built for publication: Intersection of \(-\omega \)-regular expressions