Results 41 to 42 of about 242 (42)
$\omega$-regular Expression Synthesis from Transition-Based B\"uchi Automata
A popular method for modelling reactive systems is to use $\omega$-regular languages. These languages can be represented as nondeterministic B\"uchi automata (NBAs) or $\omega$-regular expressions. Existing methods synthesise expressions from state-based
Alrajeh, Dalal +2 more
core
Regular Expressions with Backreferences and Lookaheads Capture NLOG
Backreferences and lookaheads are vital features to make classical regular expressions (REGEX) practical. Although these features have been widely used, understanding of the unrestricted combination of them has been limited.
Uezato, Yuya
core