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

DOI10.1007/s10559-022-00447-0OpenAlexW4283313505MaRDI QIDQ2103759

Anatoli 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)

Related Items (1)

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

Cites Work

• Intersection of \(-\omega \)-regular expressions
• From LP formulas of the form \(F(t)\) to \(-\omega \)-regular expressions
• From $$\omega $$-Regular Expressions to Büchi Automata via Partial Derivatives

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