RUS  ENG
Full version
JOURNALS // Prikladnaya Diskretnaya Matematika // Archive

Prikl. Diskr. Mat., 2010 Number 2(8), Pages 117–123 (Mi pdm172)

Applied Automata Theory

Solving parallel equations over $\omega$-languages

V. G. Bushkov, N. V. Yevtushenko

Tomsk State University, Tomsk, Russia

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.

UDC: 519.713



© Steklov Math. Inst. of RAS, 2026