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.