A Finite Automaton to Represent Structure of Conjugate and Single Bangla Letters

摘要：

In any language the letters of that language must be detected unambiguously to form words or sentences of that language. In this paper, a grammar is represented for the rules of conjugate and single letters in the alphabet of Bangla language and then an automaton is developed to represent the grammar. At first, rules of conjugate and single Bangla letters are stated then those rules are symbolized and presented in an automaton. Finally the finiteness and completeness of the automaton are shown.

关键词： component Letters of Bangla language Semantic web technologies in education Automaton bangla

作者: Sanjib Kumar Saha Ahmed Mashfique Raihan M.Kaykobad

作者单位: Ahsanullah University of Science and Technology Dhaka, Bangladesh Bangladesh University of Engineering and Technology Dhaka, Bangladesh Bangladesh University of Science and Technology Dhaka, Bangladesh

会议类型: 国际会议

会议名称: 2010 2nd International Conference on Education Technology and Computer(第二届IEEE教育技术与计算机国际会议 ICETC 2010)

会议地点: 上海

会议语种:英文

页码: 20-22

在线出版日期: 2010-06-22（万方平台首次上网日期，不代表论文的发表时间）