Abstract:
The paper is devoted to the problem of solving equations over $\omega$-languages. Similar to formal languages, a solvable equation over $\omega$-languages has the largest solution and the formula of the largest solution is similar to that for formal languages.
Keywords:automata equations, parallel composition of $\omega$-languages, equations over $\omega$-languages, Büchi automata.