17th TRS meeting (ETL, Amagasaki, Osaka, November 20-21, 2000)

Organized by Hitoshi Ohsaki (ETL)

List of presentations.

    11/20 (Mon) 10:00-12:30
  1. Aart Middeldorp (University of Tsukuba), Termination by Transformation of Context-Sensitive Rewriting.
  2. Toshinori Takai (Nara Institute of Science and Technology), Right-Linear Finite Path Overlapping Term Rewriting Systems Effectively Preserve Recognizability.
  3. Yasunori Ishihara (Osaka University), The Security Problem Against Inference Attacks on Object-Oriented Databases.
    11/20 (Mon) 13:30-17:30
  4. Shoji Yuen (Nagoya University), Rooted Eager Bisimulations for Process Languages.
  5. Mizuhito Ogawa (JST PRESTO and NTT Communication Science Laboratories), Well-Quasi-Orders and Regular $\omega$-laguages.
  6. Masahiko Sakai (Nagoya University), Tree Automata that Recognize Matched Set for a Higher Order Pattern.
  7. Keiichirou Kusakari (Tohoku University), RPO, DP and AF-method on TRS with Higher-Order Variables.
  8. Yuichi Kaji (Nara Institute of Science and Technology), Grammar-Based Codes by J.C.Keiffer and E.Yang (IEEE Trans. Information Theory, 46, 3, pp.737-754).
    11/21 (Tue) 9:30-12:30
  9. Taro Suzuki (Tohoku University), Completeness of Abstract Narrowing with Lambda Terms.
  10. Ould Seyid Ahmed (Nagoya University), Confluence of Non-Linear TRS, and CTRS with Extra-Variables.
  11. Hitoshi Ohsaki (Electrotechnical Laboratory), Boolean Operations over AC-Tree Languages.
  12. Aart Middeldorp (University of Tsukuba), Improving Automatic Termination by Tree Automata Techniques.

List of participants.