OTAS Program Tool for Text Matching Problems
Abstract
OTAS is a toolkit for solving any text matching problems from a fixed class. OTAS synthesize online tessallation automata solving the problem.
References
K.Inoue and A.Nakamura. Some properties of two-dimensional on-line tessellation acceptors.Information Sciences,vol.13, p.95-121, 1977.
K.Inoue and A.Nakamura. A Survey of two-dimensional automata theory. In P roc. 5thInt. M eeting of Young Computer Scientists.J Dasson and J.Kelemen (Eds.), p. 72-91. LectureNotes in Computer Science 381, Springer-Verlag, Berlin, 1990.
D.Giammarresi and A.Restivo. Two-dimensional languages. In Handbook of F ormalL aguage Theory, v.3, Springer-Verlag, N.Y.,1996.
D.Giammarresi, A.Restivo, S.Siebert and W.Thomas. Monadic second order logic overrectangular pictures and recognizability by tiling systems. Information and computation.Vol.125, No. 1, p. 32-45, 1996.
L. Boasson, P. Cegielski, I. Guessarian, Y. Matiyasevich. Window accumulated subsequencematching is linear. Annals of P ure and Applied L ogic Vol. 113(2001),pp.59-80.
K. V. Shahbazyan, Yu. H. Shoukourian. The Finite-state Recognizability of sequencesof Integers.Transactions of the Institute for Informatic and Automation P roblems of NASR A. Vol 27,(2006), 151-173
A. V. Kocharyan, K. V. Shahbazyan. On-line Tessellation automata as a text MatchingProblems Solver.Transactions of the Institute for Informatic and Automation P roblems ofNAS R A. Vol 27,(2006), 54-62.
C.T. Djamegni and M. Tchuente. A New Dynamic Programming Algorithm on twodimensional arrays. P arallel P rocessing L etters, 10(1)(2000) 15-27.
Downloads
Published
How to Cite
Issue
Section
License
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.
