메뉴 건너뛰기




Volumn 340, Issue 2, 2005, Pages 349-363

Regular splicing languages and subclasses

Author keywords

Automata; Molecular computing; Regular languages; Splicing systems

Indexed keywords

AUTOMATA THEORY; COMPUTATIONAL COMPLEXITY; COMPUTER SCIENCE; DNA; NATURAL SCIENCES COMPUTING; SYNTACTICS;

EID: 20344383228     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2005.03.035     Document Type: Article
Times cited : (19)

References (27)
  • 3
    • 84949813419 scopus 로고    scopus 로고
    • Decision problems on linear and circular splicing
    • M. Ito, M. Toyama (Eds.), Proc. DLT 2002 Springer, Berlin
    • P. Bonizzoni, C. De Felice, G. Mauri, R. Zizza, Decision Problems on Linear and Circular Splicing, in: M. Ito, M. Toyama (Eds.), Proc. DLT 2002, Lecture Notes in Computer Science, Vol. 2450, Springer, Berlin, 2003, pp. 78-92.
    • (2003) Lecture Notes in Computer Science , vol.2450 , pp. 78-92
    • Bonizzoni, P.1    De Felice, C.2    Mauri, G.3    Zizza, R.4
  • 4
    • 35248835983 scopus 로고    scopus 로고
    • Regular languages generated by reflexive finite linear splicing systems
    • Z. Esik, Z. Fülöp (Eds.), Proc. DLT 2003 Springer, Berlin
    • P. Bonizzoni, C. De Felice, G. Mauri, R. Zizza, Regular Languages Generated by Reflexive Finite Linear Splicing Systems, in: Z. Esik, Z. Fülöp (Eds.), Proc. DLT 2003, Lecture Notes in Computer Science, Vol. 2710, Springer, Berlin, 2003, pp. 134-145.
    • (2003) Lecture Notes in Computer Science , vol.2710 , pp. 134-145
    • Bonizzoni, P.1    De Felice, C.2    Mauri, G.3    Zizza, R.4
  • 6
    • 16344373420 scopus 로고    scopus 로고
    • The structure of reflexive regular splicing languages via Schützenberger constants
    • P. Bonizzoni, C. De Felice, R. Zizza, The structure of reflexive regular splicing languages via Schützenberger constants, Theoret. Comput. Sci. 334 (1-3) (2005) 71-98.
    • (2005) Theoret. Comput. Sci. , vol.334 , Issue.1-3 , pp. 71-98
    • Bonizzoni, P.1    De Felice, C.2    Zizza, R.3
  • 9
    • 0347541029 scopus 로고
    • Splicing semigroups of dominoes and DNA
    • K. Culik, and T. Harju Splicing semigroups of dominoes and DNA Discrete Appl. Math. 31 1991 261 277
    • (1991) Discrete Appl. Math. , vol.31 , pp. 261-277
    • Culik, K.1    Harju, T.2
  • 10
    • 0013531111 scopus 로고
    • A characterization of strictly locally testable languages and its application to semigroups of free semigroup
    • A. De Luca, and A. Restivo A characterization of strictly locally testable languages and its application to semigroups of free semigroup Inform. Control 44 1980 300 319
    • (1980) Inform. Control , vol.44 , pp. 300-319
    • De Luca, A.1    Restivo, A.2
  • 13
    • 0023494703 scopus 로고
    • Formal language theory and DNA: An analysis of the generative capacity of specific recombinant behaviours
    • T. Head Formal language theory and DNA: an analysis of the generative capacity of specific recombinant behaviours Bull. Math. Biol. 49 1987 737 759
    • (1987) Bull. Math. Biol. , vol.49 , pp. 737-759
    • Head, T.1
  • 14
    • 16344392838 scopus 로고    scopus 로고
    • Splicing languages generated with one sided context
    • Gh. Paun Springer Singapore
    • T. Head Splicing languages generated with one sided context Gh. Paun Computing with Bio-molecules, Theory and Experiments 1998 Springer Singapore
    • (1998) Computing with Bio-molecules, Theory and Experiments
    • Head, T.1
  • 15
    • 0001501328 scopus 로고    scopus 로고
    • Language theory and molecular genetics: Generative mechanisms suggested by DNA recombination
    • G. Rozenberg A. Salomaa Springer Berlin
    • T. Head, Gh. Paun, and D. Pixton Language theory and molecular genetics: generative mechanisms suggested by DNA recombination G. Rozenberg A. Salomaa Handbook of Formal Languages Vol. 2 1996 Springer Berlin 295 360
    • (1996) Handbook of Formal Languages , vol.2 , pp. 295-360
    • Head, T.1    Paun, Gh.2    Pixton, D.3
  • 17
    • 3142567318 scopus 로고    scopus 로고
    • Computational modeling for genetic splicing systems
    • S.M. Kim Computational modeling for genetic splicing systems SIAM J. Comput. 26 1997 1284 1309
    • (1997) SIAM J. Comput. , vol.26 , pp. 1284-1309
    • Kim, S.M.1
  • 18
    • 0028743322 scopus 로고
    • Computing the order of a locally testable automaton
    • S.M. Kim, and R. McNaughton Computing the order of a locally testable automaton SIAM J. Comput. 23 1994 1193 1215
    • (1994) SIAM J. Comput. , vol.23 , pp. 1193-1215
    • Kim, S.M.1    McNaughton, R.2
  • 19
    • 13544264716 scopus 로고    scopus 로고
    • On the splicing operation
    • G. Paun On the splicing operation Discrete Appl. Math. 70 1996 57 79
    • (1996) Discrete Appl. Math. , vol.70 , pp. 57-79
    • Paun, G.1
  • 23
    • 0004256984 scopus 로고
    • English translation Plenum, New York
    • English translation: Varieties of formal languages, Plenum, New York, 1986.
    • (1986) Varieties of Formal Languages
  • 24
    • 0000262403 scopus 로고    scopus 로고
    • Regularity of splicing languages
    • D. Pixton Regularity of splicing languages Discrete Appl. Math. 69 1996 101 124
    • (1996) Discrete Appl. Math. , vol.69 , pp. 101-124
    • Pixton, D.1
  • 25
    • 0013556466 scopus 로고
    • Sur certaines opérations de fermeture dans le langages rationnels
    • M.P. Schützenberger Sur certaines opérations de fermeture dans le langages rationnels Symposia Math. 15 1975 245 253
    • (1975) Symposia Math. , vol.15 , pp. 245-253
    • Schützenberger, M.P.1
  • 26
    • 16344364639 scopus 로고    scopus 로고
    • 1-splicing vs. 2-splicing: Separating results
    • Turku, Finland
    • S. Verlan, R. Zizza. 1-splicing vs. 2-splicing: separating results, Proc. Words03, Turku, Finland, 2003, pp. 320-331.
    • (2003) Proc. Words03 , pp. 320-331
    • Verlan, S.1    Zizza, R.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.