Zobrazeno 1 - 1
of 1
pro vyhledávání: '"Zimerman, Oded"'
Families of DFAs (FDFAs) are a computational model recognizing $\omega$-regular languages. They were introduced in the quest of finding a Myhill-Nerode theorem for $\omega$-regular languages, and obtaining learning algorithms. FDFAs have been shown t
Externí odkaz:
http://arxiv.org/abs/2310.16022
