DocumentCode
3269999
Title
A finite automaton to represent structure of conjugate and single Bangla letters
Author
Saha, Sanjib Kumar ; Raihan, Ahmed Mashfique ; Kaykobad, M.
Author_Institution
Ahsanullah Univ. of Sci. & Technol., Dhaka, Bangladesh
Volume
5
fYear
2010
fDate
22-24 June 2010
Abstract
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.
Keywords
finite automata; grammars; natural language processing; Bangla language; Bangla letters; conjugate rules; finite automaton; grammar; Automata; Computer science education; Educational technology; Electronic mail; Natural languages; Automaton bangla; Letters of Bangla language; Semantic web technologies in education; component;
fLanguage
English
Publisher
ieee
Conference_Titel
Education Technology and Computer (ICETC), 2010 2nd International Conference on
Conference_Location
Shanghai
Print_ISBN
978-1-4244-6367-1
Type
conf
DOI
10.1109/ICETC.2010.5529953
Filename
5529953
Link To Document