An algorithm for identifying spliced languages

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1276, Issue , 1997, Pages 403-411

  Kim, Sam M ^a  

^a Kyungpook National University   (South Korea)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

SPLICING SYSTEMS; STATE TRANSITION GRAPHS;

COMBINATORIAL MATHEMATICS;

EID: 84947725421     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0045107     Document Type: Conference Paper

References (8)

1. K. Culik II and T. Harju, Splicing semigroups of dominos and DNA, Discrete Applied Mathematics 31 (1991), pp. 261-277.
2. R.W. Gatterdam, Algorithms for Splicing Systems, SIAM J. Computing 21 (1992), pp. 507-520.
3. M. Harrison, Introduction to Formal Language Theory, Addison Wesley, (1978).
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.
5. J. Hopcroft and J. Ullman, Introduction to Automata Theory, Languages and Computation, Addison Wesley, (1979).
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.
7. S. Kim, Computational Modeling for Genetic Splicing Systems, (to appear in SIAM J. Computing)
8. S. Kim, Identifying Genetically Spliced Languages, Proc. of ICEC'97, pp. 231-235.