Publications International
Technical Reports and Drafts
Hitoshi Ohsaki, Hiroyuki Seki and Toshinori Takai:
Recognizable A-Tree Languages are Boolean Closed.
Technical Report AIST–PS–2003–001,
AIST, 2003.
AIST technical report URL:
http://unit.aist.go.jp/cvs/techrep.html
Hitoshi Ohsaki:
Emptiness Problem of AC-Tree Automata is Decidable.
Manuscript,
2001. (The main result is included in our RTA'02 paper)