+7 (3412) 91 60 92

## Archive of Issues

Russia Izhevsk
Year
2012
Issue
2
Pages
63-73
 Section Mathematics Title Regular expressions in the mathematical text recognition problem Author(-s) Saparov A.Yu.a, Beltyukov A.P.a Affiliations Udmurt State Universitya Abstract The work is devoted to use of regular expressions at recognition of hand-written mathematic texts. The main problem in handwritten mathematical formula recognition is that these texts mainly consist of a large number of small fragments, arranged in accordance with some strict rules. Despite the fact that formal definition of syntax of mathematic texts can involve context-free grammars and even more complicated constructions, it frequently suffices definition of mathematical language on the base of regular expressions for successful recognition. Since some constructions can occur in mathematic texts frequently than other, we introduce the concept of the weighed regular expression. The weights determine preference of some constructions before other ones. In the work, mathematical tools for use of such expressions at recognition is introduced. Theorems about intersection of weighed sets defined by such regular expressions are proved. Some estimations are given to complexity of algorithms work using such regular expressions for recognition. Keywords regular sets, regular expressions, regular operations UDC 510.5, 512.6 MSC 03D05, 68Q17 DOI 10.20537/vm120206 Received 30 March 2012 Language Russian Citation Saparov A.Yu., Beltyukov A.P. Regular expressions in the mathematical text recognition problem, Vestnik Udmurtskogo Universiteta. Matematika. Mekhanika. Komp'yuternye Nauki, 2012, issue 2, pp. 63-73. References Karpov Y.G. Teoriya avtomatov (Automata theory), St. Petersburg: Piter, 2003, 208 p. Chashkin A.V. Lektsii po diskretnoi matematike (Lectures on discrete mathematics), Moscow: Moscow State University, 2007, 261 p. Full text