Zobrazeno 1 - 1
of 1
pro vyhledávání: '"Chernev, Anton"'
$\Omega$-automata and Wilke algebras are formalisms for characterising $\omega$-regular languages via their ultimately periodic words. $\Omega$-automata read finite representations of ultimately periodic words, called lassos, and they are a subclass
Externí odkaz:
http://arxiv.org/abs/2407.14115
