Skip to main content
SpringerLink
Log in

An algorithm for identifying spliced languages

  • Session 12: Automata, Languages and Complexity
  • Conference paper
  • First Online:
Book cover Computing and Combinatorics (COCOON 1997)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1276))

Included in the following conference series:

Abstract

The paper presents an algorithm for the problem of deciding whether or not a language L, given in terms of the state transition graph of the reduced finite state automaton whose language is L, can be generated by a splicing system with a finite initial set of strings using a given enzyme set X. The algorithm is based on the properties of cycles of the state transition graph that should be satisfied if the language can be spliced with a finite initial set of strings.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. K. Culik II and T. Harju, Splicing semigroups of dominos and DNA, Discrete Applied Mathematics 31 (1991), pp. 261–277.

    Google Scholar 

  2. R.W. Gatterdam, Algorithms for Splicing Systems, SIAM J. Computing 21 (1992), pp. 507–520.

    Google Scholar 

  3. M. Harrison, Introduction to Formal Language Theory, Addison Wesley, (1978).

    Google Scholar 

  4. T. Head, Formal Language Theory and DNA: An Analysis of the Generative Capacity of Specific Recombinant Behaviors, Bulletin of Mathematical Biology 49 (1987), pp. 737–759.

    Google Scholar 

  5. J. Hopcroft and J. Ullman, Introduction to Automata Theory, Languages and Computation, Addison Wesley, (1979).

    Google Scholar 

  6. S. Kim, R. McNaughton and R. McCloskey, A Polynomial Time Algorithm for the Local Testability Problem of Deterministic Finite Automata, IEEE Trans. Computers 40 (1991), pp. 1087–1093.

    Google Scholar 

  7. S. Kim, Computational Modeling for Genetic Splicing Systems, (to appear in SIAM J. Computing)

    Google Scholar 

  8. S. Kim, Identifying Genetically Spliced Languages, Proc. of ICEC'97, pp. 231–235.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Engineering, Kyungpook National University, Taegu, Korea

    Sam M. Kim

Authors
  1. Sam M. Kim
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Tao Jiang D. T. Lee

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kim, S.M. (1997). An algorithm for identifying spliced languages. In: Jiang, T., Lee, D.T. (eds) Computing and Combinatorics. COCOON 1997. Lecture Notes in Computer Science, vol 1276. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0045107

Download citation

  • DOI: https://doi.org/10.1007/BFb0045107

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-63357-0

  • Online ISBN: 978-3-540-69522-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation