 | 2008 |
|---|
| 14 |       | Joe Hendrix,
Hitoshi Ohsaki:
Combining Equational Tree Automata over AC and ACI Theories.
RTA 2008: 142-156 |
| 13 | | Naoki Kobayashi,
Hitoshi Ohsaki:
Tree Automata for Non-linear Arithmetic.
RTA 2008: 291-305 |
| 2007 |
|---|
| 12 | | Hitoshi Ohsaki,
Hiroyuki Seki:
Languages Modulo Normalization.
FroCos 2007: 221-236 |
| 2006 |
|---|
| 11 | | Joe Hendrix,
José Meseguer,
Hitoshi Ohsaki:
A Sufficient Completeness Checker for Linear Order-Sorted Specifications Modulo Axioms.
IJCAR 2006: 151-155 |
| 10 | | Joe Hendrix,
Hitoshi Ohsaki,
Mahesh Viswanathan:
Propositional Tree Automata.
RTA 2006: 50-65 |
| 2005 |
|---|
| 9 | | Hitoshi Ohsaki,
Jean-Marc Talbot,
Sophie Tison,
Yves Roos:
Monotone AC-Tree Automata.
LPAR 2005: 337-351 |
| 8 | | 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) |
| 2003 |
|---|
| 7 | | Hitoshi Ohsaki,
Hiroyuki Seki,
Toshinori Takai:
Recognizing Boolean Closed A-Tree Languages with Membership Conditional Rewriting Mechanism.
RTA 2003: 483-498 |
| 2002 |
|---|
| 6 | | Hitoshi Ohsaki,
Toshinori Takai:
Decidability and Closure Properties of Equational Tree Languages.
RTA 2002: 114-128 |
| 2001 |
|---|
| 5 | | Hitoshi Ohsaki:
Beyond Regularity: Equational Tree Automata for Associative and Commutative Theories.
CSL 2001: 539-553 |
| 2000 |
|---|
| 4 | | Hitoshi Ohsaki,
Aart Middeldorp,
Jürgen Giesl:
Equational Termination by Semantic Labelling.
CSL 2000: 457-471 |
| 3 | | Aart Middeldorp,
Hitoshi Ohsaki:
Type Introduction for Equational Rewriting.
Acta Inf. 36(12): 1007-1029 (2000) |
| 1997 |
|---|
| 2 |  | Hitoshi Ohsaki,
Aart Middeldorp:
Type Introduction for Equational Rewriting.
LFCS 1997: 283-293 |
| 1996 |
|---|
| 1 | | Aart Middeldorp,
Hitoshi Ohsaki,
Hans Zantema:
Transforming Termination by Self-Labelling.
CADE 1996: 373-387 |
