Analysis of Bangla-2-Braille machine translator

Bangla-2-Braille machine translator is implemented using rule based Discrete Finite Automata (DFA) [1]. Rule based DFA directs the necessity of generating regular expression from the DFA in order to validate the language model used for Braille conversion and extend the translator for better usability by the visually impaired people. In this work, we conducted experiments using structured and state elimination method to generate, and validate regular expressions from the DFA designed for Bangla-2-Braille machine translator. The generated expressions were tested for Braille language rules and the results were satisfactory.