| 2001 |
|---|
| 9 | EE | Robert Fidytek,
Andrzej Wlodzimierz Mostowski,
Rafal Somla,
Andrzej Szepietowski:
Algorithms counting monotone Boolean functions.
Inf. Process. Lett. 79(5): 203-209 (2001) |
| 1991 |
|---|
| 8 | | Andrzej Wlodzimierz Mostowski:
Hierarchies of Weak Automata and Weak Monadic Formulas.
Theor. Comput. Sci. 83(2): 323-335 (1991) |
| 1990 |
|---|
| 7 | | Andrzej Wlodzimierz Mostowski:
Alternating Automata with Start Formulas.
Inf. Process. Lett. 35(6): 287-290 (1990) |
| 1987 |
|---|
| 6 | | Andrzej Wlodzimierz Mostowski:
Hierarchies of Weak Monadic Formulas for Two Successors Arithmetic.
Elektronische Informationsverarbeitung und Kybernetik 23(10/11): 509-515 (1987) |
| 1982 |
|---|
| 5 | | Andrzej Wlodzimierz Mostowski:
Determinancy of Sinking Automata on Infinite Trees and Inequalities Between Various Rabin's Pair Indices.
Inf. Process. Lett. 15(4): 159-163 (1982) |
| 1981 |
|---|
| 4 | | Andrzej Wlodzimierz Mostowski:
The Complexity of Automata and Subtheories of Monadic Second Order Arithmetics.
FCT 1981: 453-466 |
| 1980 |
|---|
| 3 | | Andrzej Wlodzimierz Mostowski:
Finite automata on infinite trees and subtheories of SkS.
CLAAP 1980: 228-240 |
| 2 | | Andrzej Wlodzimierz Mostowski:
Nearly deterministic automata acceptation of infinite trees and a complexitiy of weak theory of SkS.
CLAAP 1980: 54-62 |
| 1977 |
|---|
| 1 | | Andrzej Wlodzimierz Mostowski:
Operations on omega-Regular Languages.
FCT 1977: 135-141 |
