메뉴 건너뛰기




Volumn 267, Issue 1-2, 2001, Pages 35-47

Normal form algorithms for extended context-free grammars

Author keywords

Complexity; Efficient algorithms; Extended context free grammars; Grammatical representations; Normal forms; Symbolic manipulation

Indexed keywords

ALGORITHMS; C (PROGRAMMING LANGUAGE); COMPUTATIONAL COMPLEXITY; FORMAL LANGUAGES;

EID: 0035964995     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(00)00294-2     Document Type: Conference Paper
Times cited : (26)

References (26)
  • 10
    • 84945707998 scopus 로고
    • A new normal form theorem for context-free phrase structure grammars
    • (1965) J. ACM , vol.12 , pp. 42-52
    • Greibach, S.A.1
  • 14
  • 16
    • 0003488661 scopus 로고
    • ISO 8879: Information processing - Text and office systems - Standard Generalized Markup Language (SGML), International Organization for Standardization, October
    • (1986)


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