Searching for authors named "Hitoshi Ohsaki" – sorted by Relevance.
9 documents found, showing 1 through 9.
-
Emptiness Problem of AC-Tree Automata is Decidable
- …Emptiness Problem of AC-Tree Automata is Decidable Hitoshi Ohsaki National Institute of Advanced…
- Add To MetaCart
-
Decidability and closure properties of equational tree languages
- …Decidability and Closure Properties of Equational Tree Languages Hitoshi Ohsaki and Toshinori…
- Cited by 10 (6 self) – Add To MetaCart
-
Monotone AC-Tree Automata
- …Monotone AC-Tree Automata Hitoshi Ohsaki 1 , Jean-Marc Talbot 2 , Sophie Tison 2 and Yves Roos 2 1…
- Cited by 3 (1 self) – Add To MetaCart
-
Sufficient Completeness Checking with Propositional Tree Automata
- …Sufficient Completeness Checking with Propositional Tree Automata Joe Hendrix 1 , Hitoshi Ohsaki 2…
- Cited by 5 (3 self) – Add To MetaCart
-
Propositional tree automata
- …Propositional Tree Automata ⋆ Joe Hendrix 1 , Hitoshi Ohsaki 2 , and Mahesh Viswanathan 1 1…
- Cited by 3 (2 self) – Add To MetaCart
-
Transforming Termination by Self-Labelling
- …Transforming Termination by Self-Labelling Aart Middeldorp, 1 Hitoshi Ohsaki, 1 Hans Zantema 2…
- Cited by 16 (4 self) – Add To MetaCart
-
Equational Termination by Semantic Labelling
- …Equational Termination by Semantic Labelling ? Hitoshi Ohsaki 1 , Aart Middeldorp 2 , and J…
- Cited by 3 (1 self) – Add To MetaCart
-
Recognizing boolean closed A-tree languages with membership conditional mechanism
- … Hitoshi Ohsaki 1,2 , Hiroyuki Seki 3 , and Toshinori Takai 2 1 PRESTO “Information and Systems” Japan…
- Cited by 6 (1 self) – Add To MetaCart
-
Equational Termination by Semantic Labelling
- …Equational Termination by Semantic Labelling ? Hitoshi Ohsaki 1 , Aart Middeldorp 2 , and J…
- Add To MetaCart
Showing 1 through 9.
