메뉴 건너뛰기




Volumn 31, Issue 2, 1997, Pages 117-124

Natural computation for natural language

Author keywords

Formal Language Theory; Mathematical Linguistics; Theory of Computation

Indexed keywords

COMPUTABILITY AND DECIDABILITY; FORMAL LANGUAGES; NATURAL LANGUAGE PROCESSING SYSTEMS; THEOREM PROVING;

EID: 0031197717     PISSN: 01692968     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article
Times cited : (6)

References (11)
  • 1
    • 0347165621 scopus 로고
    • On representing RE languages by one-sided internal contextual languages
    • Department of Computer Science, Leiden University
    • Ehrenfeucht, A., A. Mateescu, Gh. Pǎun, G. Rozenberg & A. Salomaa: "On representing RE languages by one-sided internal contextual languages", Technical Report 95-04, Department of Computer Science, Leiden University, 1995.
    • (1995) Technical Report 95-04
    • Ehrenfeucht, A.1    Mateescu, A.2    Pǎun, Gh.3    Rozenberg, G.4    Salomaa, A.5
  • 2
    • 0346462358 scopus 로고    scopus 로고
    • On representing recursively enumerable languages by internal contextual languages
    • to appear
    • Ehrenfeucht, A., Gh. Pǎun & G. Rozenberg: "On representing recursively enumerable languages by internal contextual languages", Theoretical Computer Science, 1997, to appear.
    • (1997) Theoretical Computer Science
    • Ehrenfeucht, A.1    Pǎun, Gh.2    Rozenberg, G.3
  • 4
    • 0023494703 scopus 로고
    • Formal language theory and DNA: An analysis of the generative capacity of specific recombinant behaviours
    • Head, T.: "Formal language theory and DNA: an analysis of the generative capacity of specific recombinant behaviours", Bulletin of Mathematical Biology, 49, 1987, 737-759.
    • (1987) Bulletin of Mathematical Biology , vol.49 , pp. 737-759
    • Head, T.1
  • 7
    • 4243083238 scopus 로고    scopus 로고
    • Characterizations of recursively enumerable languages by means of insertion grammars
    • to appear
    • Martín-Vide, C., Gh. Pǎun & A. Salomaa: "Characterizations of recursively enumerable languages by means of insertion grammars", Theoretical Computer Science, 1997, to appear.
    • (1997) Theoretical Computer Science
    • Martín-Vide, C.1    Pǎun, Gh.2    Salomaa, A.3
  • 8


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