Complementation of - \( \omega \)-regular expressions. I

DOI10.1007/S10559-024-00724-0MaRDI QIDQ6660265

A. N. Chebotarev

Publication date: 10 January 2025

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

zbMATH Keywords

-\( \omega \)-regular expressionalphabet \(\Sigma' \)complement of -\( \omega \)-regular expressioncontiguity conditioncontiguous wordssuffix of regular expression

Mathematics Subject Classification ID

Theory of computing (68Qxx) Computer science (68-XX) Computability and recursion theory (03Dxx)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Synthesis of \(\Sigma\)-automata specified in the first order logical languages LP and LF
• Intersection of \(-\omega \)-regular expressions
• Detecting fictitious states in a \(\Sigma \)-automaton synthesized from its specification in the language LP
• Unifying B\"uchi Complementation Constructions
• Tools and Algorithms for the Construction and Analysis of Systems
• Towards a grand unification of Büchi complementation constructions

This page was built for publication: Complementation of - \( \omega \)-regular expressions. I

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