Computer Science: 1998-1999

Andrews, J. 1998. On the Spreadsheet Presentation of Proof Obligations. Informal Proceedings of the Workshop on User Interfaces for Theorem Provers. Eindhoven University of Technology: 13 July 1998-15 July 1998. R.C. Backhouse, and J.C.M. Baeten. Computing Science Reports 98/08. Eindhoven, Netherlands: Eindhoven University of Technology. 34-41. Also available at http//www.win.tue.nl/win/ca.

Andrews, J. 1998. Testing Using Log File Analysis: An Extended Example. Proceedings of the First International Workshop on Technological Challenges of Electronic Commerce. Markham, ON: Midrange Computing. 1-.

Andrews, J. 1998. Testing Using Log File Analysis: Tools, Methods, and Issues. 13th IEEE International Conference on Automated Software Engineering. Honolulu, Hawaii: 13 October 1998-16 October 1998. Los Alamitos, California: IEEE Computer Society. 157-166.

Yates, R., J. Andrews, and P. Gray. 1998. Practical Experience Applying Formal Methods to Air Traffic Management Software. Proceedings of 8th Annual International Symposium of the International Council on Systems Engineering (INCOSE '98). Vancouver, BC: INCOSE.

Katchabaw, M., H. Lutfiyya, and M. Bauer. 1998. A Model for Resource Management to Support End-to-End Application-Driven Quality of Service. Technical Report #528. The University of Western Ontario, Computer Science Department: London, ON. 15 pp.

Dunham, C. 1998. Monotone and Convex Forms? Technical Report #530. The University of Western Ontario, Computer Science Department: London, ON. 4 pp.

Dunham, C. 1999. Monotone and Convex Forms? II. Technical Report #532. The University of Western Ontario, Computer Science Department: London, ON. 5 pp.

Dunham, C. 1998. Problems in Best Approximation, XI. Technical Report #531. The University of Western Ontario, Computer Science Department: London, ON. 3 pp.

Brzozowski, J.A., and H. Jürgensen. 1999. Semilattices of Fault Semiautomata. Technical Report #535. The University of Western Ontario, Computer Science Department: London, ON. 15 pp.

Jürgensen, H. 1999. Towards Computer Science. Technical Report #529. The University of Western Ontario, Computer Science Department: London, ON. 11 pp.

Jürgensen, H., and S. Konstantinidis. 1999. Maximal Solid Codes. Technical Report #533. The University of Western Ontario, Computer Science Department: London, ON. 23 pp.

Freund, R., L. Kari, and G. Paun. 1999. DNA computing based on splicing: The existence of universal computers. Theory of Computing Systems 32: 69-112.

Gloor, G., L. Kari, M. Gaasenbeek, and S. Yu. 1998. Towards a DNA Solution to the Shortest Common Superstring Problem. Proceedings of the IEEE International Joint Symposia on Intelligence and Systems. Rockville, Maryland: 21 May 1998-23 May 1998. Los Alamitos, CA: IEEE Computer Society. 140-145.

Ito, M., L. Kari, and G. Thierrin. 1997. Insertion and deletion closure of languages. Theoretical Computer Science 183: 3-19.

Kari, L. 1997. DNA Computing: Arrival of Biological Mathematics. The Mathematical Intelligencer 19 (2): 9-22.

Kari, L. 1997. From Micro-soft to Bio-Soft: Computing with DNA. Proceedings of BCEC 97: Biocomputing and Emergent Computation. Skovde, Sweden: 1 September 1997-2 September 1997. D. Lundh, B. Olsson, and A. Narayanan. Singapore: World Scientific. 146-164.

Kari, L., and L. Landweber. 1999. Computational Power of Gene Rearrangement. Proceedings of the Fifth International Meeting on DNA Based Computers. Massachusetts Institute of Technology: 14 June 1999-15 June 1999. E. Winfree, and D. Gifford. Boston: 203-213.

Kari, L., H. Lutfiyya, G. Paun, and C. Martin-Vide. 1999. Bringing PC Grammar Systems Closer to Hoare's CSP's. Grammatical Models of Multi-Agent Systems. G. Paun, and A. Salomaa. Gordon and Breach Science Publishers. 64-86.

Kari, L., G. Paun, G. Rozenberg, A. Salomaa, and S. Yu. 1998. DNA computing, sticker systems, and universality. Acta Informatica 35: 401-420.

Kari, L., G. Paun, G. Thierrin, and S. Yu. 1999. At the Crossroads of DNA Computing and Formal Languages: Characterizing Recursively Enumerable Languages Using Insertion-Deletion Systems. DNA Based Computers III. 23 June 1997-25 June 1997. H. Rubin, and D.H. Wood. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Vol. 48. Providence, Rhode Island: American Mathematics Society. 329-347.

Kari, L., G. Rozenberg, and A. Salomaa. 1997. L Systems. Handbook of Formal Languages. Volume 1: Word, Language, Grammar. G. Rozenberg, and A. Salomaa. Berlin, Germany: Springer-Verlag. 253-328.

Kari, L., and Y. Sakakibara. 1997. DNA Computers. Journal of the Institute of Electronics, Information and Communication Engineers 80 (9): 935-939. Japanese text.

Kari, L., and G. Thierrin. 1998. Word insertions and primitivity. Utilitas Mathematica 53: 49-61.

Landweber, L., and L. Kari. 1998. The Evolution of Cellular Computing: Nature's Solution to a Computational Problem. Proceedings of the Fourth International Meeting on DNA Based Computers. University of Pennsylvania: 15 June 1998-19 June 1998. L. Kari, H. Rubin, and D.H. Wood. Evolution As Computation. Pennsylvania: 3-15.

Landweber, L., and L. Kari. 1998. The Evolution of Cellular Computing: Nature's Solution to a Computational Problem. Late Breaking Papers at the Genetic Programming 1998 Conference, Proceedings of the 3rd Annual Genetic Programming Conference. 22 July 1998-25 July 1998. J.R. Koza. San Francisco, CA: Morgan Kaufmann Publishers. 700-708.

Landweber, L., and L. Kari. 1999. Universal molecular computation in ciliates. Proceedings of the DIMACS Workshop on Evolution as Computation. Princeton University: 11 January 1999-11 January 1999. L. Landweber, E. Winfree, R. Lipton, and S. Freeland. Evolution As Computation. New York: Springer-Verlag. 51-.

Kari, L., H. Lutfiyya, G. Paun, and C. Martin-Vide. 1999. Bringing PC Grammar Systems Closer to Hoare's CSP's. Grammatical Models of Multi-Agent Systems. G. Paun, and A. Salomaa. Gordon and Breach Science Publishers. 64-86.

Katchabaw, M., H. Lutfiyya, and M. Bauer. 1998. A Model for Resource Management to Support End-to-End Application-Driven Quality of Service. Technical Report #528. The University of Western Ontario, Computer Science Department: London, ON. 15 pp.

Rahonis, G., and K. Salomaa. 1998. On the size of stack and synchronization alphabets of tree automata. Fundamenta Informaticae 36 (1): 193-203. Also at http://joinus.comeng.chungnam.ac.kr/~dolphin/db/journals/fuin/fuin36.html.

Salomaa, K., and S. Yu. 1999. Generalized fairness and context-free languages. Acta Cybernetica 14: 193-203.

Salomaa, K., and S. Yu. 1999. Loop-free alternating finite automata. Publicationes Mathematicae Debrecen. Proceedings of the Eighth International Conference on Automata and Formal Languages 54 (Suppl.): 979-988.

Salomaa, K., and S. Yu. 1998. Synchronization expressions with extended join operation. Theoretical Computer Science 207: 73-88.

Wu, X., S. Yu, K. Salomaa, and S. Huerter. 1998. Implementing R-AFA Operations. Proceedings of the Third International Workshop on Implementing Automata, WIA '98. Rouen, France: 54-64.

Ito, M., L. Kari, and G. Thierrin. 1997. Insertion and deletion closure of languages. Theoretical Computer Science 183: 3-19.

Kari, L., G. Paun, G. Thierrin, and S. Yu. 1999. At the Crossroads of DNA Computing and Formal Languages: Characterizing Recursively Enumerable Languages Using Insertion-Deletion Systems. DNA Based Computers III. 23 June 1997-25 June 1997. H. Rubin, and D.H. Wood. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Vol. 48. Providence, Rhode Island: American Mathematics Society. 329-347.

Kari, L., and G. Thierrin. 1998. Word insertions and primitivity. Utilitas Mathematica 53: 49-61.

Wu, X., S. Yu, K. Salomaa, and S. Huerter. 1998. Implementing R-AFA Operations. Proceedings of the Third International Workshop on Implementing Automata, WIA '98. Rouen, France: 54-64.

Gloor, G., L. Kari, M. Gaasenbeek, and S. Yu. 1998. Towards a DNA Solution to the Shortest Common Superstring Problem. Proceedings of the IEEE International Joint Symposia on Intelligence and Systems. Rockville, Maryland: 21 May 1998-23 May 1998. Los Alamitos, CA: IEEE Computer Society. 140-145.

Kari, L., G. Paun, G. Rozenberg, A. Salomaa, and S. Yu. 1998. DNA computing, sticker systems, and universality. Acta Informatica 35: 401-420.

Kari, L., G. Paun, G. Thierrin, and S. Yu. 1999. At the Crossroads of DNA Computing and Formal Languages: Characterizing Recursively Enumerable Languages Using Insertion-Deletion Systems. DNA Based Computers III. 23 June 1997-25 June 1997. H. Rubin, and D.H. Wood. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Vol. 48. Providence, Rhode Island: American Mathematics Society. 329-347.

Salomaa, K., and S. Yu. 1999. Generalized fairness and context-free languages. Acta Cybernetica 14: 193-203.

Salomaa, K., and S. Yu. 1999. Loop-free alternating finite automata. Publicationes Mathematicae Debrecen. Proceedings of the Eighth International Conference on Automata and Formal Languages 54 (Suppl.): 979-988.

Salomaa, K., and S. Yu. 1998. Synchronization expressions with extended join operation. Theoretical Computer Science 207: 73-88.

Wu, X., S. Yu, K. Salomaa, and S. Huerter. 1998. Implementing R-AFA Operations. Proceedings of the Third International Workshop on Implementing Automata, WIA '98. Rouen, France: 54-64.