Abstract
In pattern matching problems, determining exact or approximative longest common subsequences of two languages appears in many practical problems. Applying weighted finite automata, as a modification of Mohri’s method (2003) in determining Levenstein edit distance of two languages, in this article, we propose an effective method which allows us to compute the longest common subsequences of two finite languages accepted by two finite automata A 1 and A 2 with the time complexity O(|A 1||A 2|), in that, |A i | is the number of states and edges of automata A i , i = 1,2.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Berstel, J., Reutenauer, C.: Rational Series and Their Languages. Springer, Berlin (1988)
Mohri, M.: Edit-Distance of Weighted Automata: General Definitions and Algorithms. International Journal of Foundations of Computer Science 14(6), 957–982 (2003)
Mohri, M., Pereira, F., Riley, M.: Speech Recognition with Weighted Finite-State Transducers. Springer Handbook of Speech Processing. Springer, Heidelberg (2007)
Salomaa, A., Soittola, M.: Automata-Theoretic Aspects of Formal Power Series. Springer, New York (1978)
Schützenberger, M.P.: On the definition of a family of automata. Information and Control 4 (1961)
Trung huy, P., Khang, N.Q.: Fuzy automaton and application to the problem of determining the longest common subsequence (in Vietnamese). In: The sixth National Conference of Maths, Vietnam (2002)
Aho, A.V.: Algorithms for Finding Patterns in String. In: Handbook of Theoretical Compter Science, ch. 5, vol. A. Elsevier Sciencs Publisher BV, Amsterdam (1990)
Jiang, T., Li, M.: On the approximation of shortest common supersequences and longest common subsequences. SIAM Journal of Computing 24(5), 1122–1139 (1995)
Iliopoulos, C.S., Sohel Rahman, M.: A New Efficient Algorithm for Computing the Longest Common Subsequence. In: Theory of Computing Systems. Springer, New York (2008)
Wagner, R.A., Fischer, M.J.: The string-to-string correction problem. J. ACM 21(1), 168–173 (1974)
Mozes, S., Tsur, D., Weimann, O., Ziv-Ukelson, M.: Fast algorithms for computing tree LCS. Theoretical Computer Science 410, 4303–4314 (2009)
Hirschberg, D.S.: An Information Theoretic Lower Bound for the Longest Common Subsequence Problem. Rice Technical Report No.7705 (1977)
Hunt, J.W., Szymanski, T.G.: A fast algorithm for computing longest subsequences. Commun. ACM 20(5), 350–353 (1977)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Thang, D.Q. (2011). Algorithm to Determine Longest Common Subsequences of Two Finite Languages. In: Nguyen, N.T., Trawiński, B., Jung, J.J. (eds) New Challenges for Intelligent Information and Database Systems. Studies in Computational Intelligence, vol 351. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-19953-0_1
Download citation
DOI: https://doi.org/10.1007/978-3-642-19953-0_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-19952-3
Online ISBN: 978-3-642-19953-0
eBook Packages: EngineeringEngineering (R0)