Andrzej Wlodzimierz Mostowski

According to our database, Andrzej Wlodzimierz Mostowski authored at least 10 papers between 1977 and 2001.

Collaborative distances:

• Dijkstra number of six.
• Erdős number of five.

2001

Algorithms counting monotone Boolean functions.

Robert Fidytek, Andrzej Wlodzimierz Mostowski, Rafal Somla, Andrzej Szepietowski

Inf. Process. Lett., 2001

1991

Hierarchies of Weak Automata and Weak Monadic Formulas.

Andrzej Wlodzimierz Mostowski

Theor. Comput. Sci., 1991

1990

Alternating Automata with Start Formulas.

Andrzej Wlodzimierz Mostowski

Inf. Process. Lett., 1990

1987

Hierarchies of Weak Monadic Formulas for Two Successors Arithmetic.

Andrzej Wlodzimierz Mostowski

J. Inf. Process. Cybern., 1987

1984

Regular expressions for infinite trees and a standard form of automata.

Andrzej Wlodzimierz Mostowski

Proceedings of the Computation Theory, 1984

1982

Determinancy of Sinking Automata on Infinite Trees and Inequalities Between Various Rabin's Pair Indices.

Andrzej Wlodzimierz Mostowski

Inf. Process. Lett., 1982

1981

The Complexity of Automata and Subtheories of Monadic Second Order Arithmetics.

Andrzej Wlodzimierz Mostowski

Proceedings of the Fundamentals of Computation Theory, 1981

1980

Finite automata on infinite trees and subtheories of SkS.

Andrzej Wlodzimierz Mostowski

Proceedings of the Proc. 5eme Colleque de Lille sur les Arbres en Algebre et en Programmation, 1980

Nearly deterministic automata acceptation of infinite trees and a complexity of weak theory of SkS.

Andrzej Wlodzimierz Mostowski

Proceedings of the Proc. 5eme Colleque de Lille sur les Arbres en Algebre et en Programmation, 1980

1977

Operations on omega-Regular Languages.

Andrzej Wlodzimierz Mostowski

Proceedings of the Fundamentals of Computation Theory, 1977