Publisher
Springer Berlin Heidelberg
Reference34 articles.
1. K. Abrahamson, Decidability and Expressiveness of Logics of Programs, Ph.D. thesis, Technical Report 80–08–01, Univ. of Washington, Seattle, 1980.
2. A.K. Chandra, D. Kozen and L. J. Stockmeyer, “Alternation”, J. Assoc. Comput. Mach. 28 (1981), 114–133
3. D. Drusinsky and D. Harel, “On the Power of Bounded Concurrency I: Finite Automata”, submitted. (Preliminary version appeared as “On the Power of Cooperative Concurrency”, Proc. Concurrency ‘88,Lecture Notes in Computer Science, Vol. 335, Springer-Verlag, New York, 1988, pp. 74–103.)
4. A. Ehrenfeucht and P. Zeiger, “Complexity measures for regular expressions”, J. Comp. Sys. Sci. 12 (1976), 134–146.
5. M. J. Fischer and R. E. Ladner, “Propositional Dynamic Logic of Regular Programs”, J. Comput. Sys. Sci. 18 (1979), 194–211.