- CSB - MetaPress - Google - Bing - Yahoo
 | 2006 | |
|---|---|---|
| c6 |      | |
| 2005 | ||
| j1 | | Hitoshi Ohsaki, Toshinori Takai: ACTAS : A System Design for Associative and Commutative Tree Automata Theory. Electr. Notes Theor. Comput. Sci. 124(1): 97-111 (2005) |
| 2004 | ||
| c5 | | Toshinori Takai: A Verification Technique Using Term Rewriting Systems and Abstract Interpretation. RTA 2004: 119-133 |
| 2003 | ||
| c4 | | Hitoshi Ohsaki, Hiroyuki Seki, Toshinori Takai: Recognizing Boolean Closed A-Tree Languages with Membership Conditional Rewriting Mechanism. RTA 2003: 483-498 |
| 2002 | ||
| c3 | | Hiroyuki Seki, Toshinori Takai, Youhei Fujinaka, Yuichi Kaji: Layered Transducing Term Rewriting System and Its Recognizability Preserving Property. RTA 2002: 98-113 |
| c2 | | Hitoshi Ohsaki, Toshinori Takai: Decidability and Closure Properties of Equational Tree Languages. RTA 2002: 114-128 |
| 2000 | ||
| c1 | | Toshinori Takai, Yuichi Kaji, Hiroyuki Seki: Right-Linear Finite Path Overlapping Term Rewriting Systems Effectively Preserve Recognizability. RTA 2000: 246-260 |
| 1 | Youhei Fujinaka | |
| 2 | Hitoshi Furusawa | |
| 3 | Yuichi Kaji | |
| 4 | Hitoshi Ohsaki | |
| 5 | Hiroyuki Seki |
Data released under the ODC-BY 1.0 license — See also our legal information page