Zobrazeno 1 - 2
of 2
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
This book constitutes the refereed proceedings of the 21st International Colloquium on Theoretical Aspects of Computing, ICTAC 2024, held in Bangkok, Thailand, during November 25–29, 2024. The 21 full papers presented here were carefully reviewed a