scispace - formally typeset
A

Akio Fujiyoshi

Researcher at Ibaraki University

Publications -  42
Citations -  197

Akio Fujiyoshi is an academic researcher from Ibaraki University. The author has contributed to research in topics: Tree automaton & Spanning tree. The author has an hindex of 8, co-authored 41 publications receiving 186 citations. Previous affiliations of Akio Fujiyoshi include Kyushu University.

Papers
More filters
Proceedings ArticleDOI

Statistical Classification of Spatial Relationships among Mathematical Symbols

TL;DR: Experimental results showed that the proposed statistical decision method for automatic classification of spatial relationships between each adjacent pair worked well with an accuracy of 99.57% by two important geometric feature relative size and relative position.
Book ChapterDOI

Verification of Mathematical Formulae Based on a Combination of Context-Free Grammar and Tree Grammar

TL;DR: This paper proposes the use of a formal grammar for the verification of mathematical formulae for a practical mathematical OCR system, and the effectiveness of the system was demonstrated by using the ground-truthed mathematical document database INFTY CDB-1.
Book ChapterDOI

The Development of a Universal Design Tactile Graphics Production System BPLOT2

TL;DR: A new universal design tactile graphics production system: BPLOT2 is introduced, where blind persons and sighted persons can share resources and cooperatively draw tactile graphics to be utilized in braille textbooks and teaching materials.
Book ChapterDOI

Development of Synchronized CUI and GUI for Universal Design Tactile Graphics Production System BPLOT3

TL;DR: Synchronized CUI and GUI are developed for the universal design tactile graphics production system BPLOT3, which enables the blind and the sighted to collaboratively produce tactile graphics.

Epsilon-Free Grammars and Lexicalized Grammars that Generate the Class of the Mildly Context-Sensitive Languages

TL;DR: This study examines whether the class of string languages can be generated by some epsilon-free grammars and by some lexicalized Grammars, and finds that using spine grammARS, this problem is solved positively.