Operations on omega-Regular Languages. - Andrzej Wlodzimierz Mostowski (FCT, 1977)

Nearly deterministic automata acceptation of infinite trees and a complexity of weak theory of SkS. - Andrzej Wlodzimierz Mostowski (CLAAP, 1980)

Finite automata on infinite trees and subtheories of SkS. - Andrzej Wlodzimierz Mostowski (CLAAP, 1980)

The Complexity of Automata and Subtheories of Monadic Second Order Arithmetics. - Andrzej Wlodzimierz Mostowski (FCT, 1981)

Determinancy of Sinking Automata on Infinite Trees and Inequalities Between Various Rabin's Pair Indices. - Andrzej Wlodzimierz Mostowski (Inf. Process. Lett., 1982)

Regular expressions for infinite trees and a standard form of automata. - Andrzej Wlodzimierz Mostowski (Symposium on Computation Theory, 1984)

Hierarchies of Weak Monadic Formulas for Two Successors Arithmetic. - Andrzej Wlodzimierz Mostowski (J. Inf. Process. Cybern., 1987)

Alternating Automata with Start Formulas. - Andrzej Wlodzimierz Mostowski (Inf. Process. Lett., 1990)

Hierarchies of Weak Automata and Weak Monadic Formulas. - Andrzej Wlodzimierz Mostowski (Theor. Comput. Sci., 1991)

Algorithms counting monotone Boolean functions. - Robert Fidytek; Andrzej Wlodzimierz Mostowski; Rafal Somla; Andrzej Szepietowski (Inf. Process. Lett., 2001)