메뉴 건너뛰기




Volumn 302, Issue 1-3, 2003, Pages 365-399

A recognition and parsing algorithm for arbitrary conjunctive grammars

Author keywords

Complexity; Conjunctive grammars; Parsing; Recognition

Indexed keywords

ALGORITHMS; COMPUTER SIMULATION; MATHEMATICAL TRANSFORMATIONS; POLYNOMIALS;

EID: 0037901023     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(02)00853-8     Document Type: Article
Times cited : (16)

References (13)
  • 1
    • 0014732304 scopus 로고
    • An efficient context-free parsing algorithm
    • Earley J. An efficient context-free parsing algorithm. Commun. ACM. 13(2):1970;94-102.
    • (1970) Commun. ACM , vol.13 , Issue.2 , pp. 94-102
    • Earley, J.1
  • 2
    • 0002711066 scopus 로고
    • The monotone and planar cirquit value problems are log space complete for P
    • Goldschlager L.M. The monotone and planar cirquit value problems are log space complete for P. SIGACT News. 9(2):1977;25-29.
    • (1977) SIGACT News , vol.9 , Issue.2 , pp. 25-29
    • Goldschlager, L.M.1
  • 3
    • 0038638461 scopus 로고
    • Parsing of general context-free languages
    • Graham S.L., Harrison M.A. Parsing of general context-free languages. Adv. in Com. 14:1976;77-185.
    • (1976) Adv. in Com. , vol.14 , pp. 77-185
    • Graham, S.L.1    Harrison, M.A.2
  • 6
    • 0016542395 scopus 로고
    • Space-bounded reducibility among combinatorial problems
    • Jones N. Space-bounded reducibility among combinatorial problems. J. Comput System Sci. 11:1975;68-85.
    • (1975) J. Comput System Sci. , vol.11 , pp. 68-85
    • Jones, N.1
  • 7
  • 8
    • 0038299523 scopus 로고    scopus 로고
    • On P-completeness of the membership problem for conjunctive grammars, an abstract of a conference talk
    • Ratmino, 31 May-3 June, Proceedings of the International School-Seminar on Discrete Mathematics and Mathematical Cybernetics
    • A. Okhotin, On P-completeness of the membership problem for conjunctive grammars, an abstract of a conference talk (in Russian), Diskretnaya matematika i matematicheskaya kibernetika: trudy mezhdunarodnoi shkoly-seminara, Ratmino, 31 May-3 June 2001, (Proceedings of the International School-Seminar on Discrete Mathematics and Mathematical Cybernetics).
    • (2001) Diskretnaya Matematika i Matematicheskaya Kibernetika: Trudy Mezhdunarodnoi Shkoly-Seminara
    • Okhotin, A.1
  • 9
    • 0036125548 scopus 로고    scopus 로고
    • Top-down parsing of conjunctive languages
    • Okhotin A. Top-down parsing of conjunctive languages. Grammars. 5(1):2002;21-40.
    • (2002) Grammars , vol.5 , Issue.1 , pp. 21-40
    • Okhotin, A.1
  • 10
    • 84976804880 scopus 로고
    • A note on tape-bounded complexity classes and linear context-free languages
    • Sudborough I.H. A note on tape-bounded complexity classes and linear context-free languages. J. Assoc. Comput. Mach. 22(4):1975;499-500.
    • (1975) J. Assoc. Comput. Mach. , vol.22 , Issue.4 , pp. 499-500
    • Sudborough, I.H.1
  • 13
    • 0002700117 scopus 로고    scopus 로고
    • Regular languages
    • Berlin: Springer-Verlag
    • Yu S. Regular Languages. Handbook of Formal Languages. Vol. 1:1997;41-110 Springer-Verlag, Berlin.
    • (1997) Handbook of Formal Languages , vol.1 , pp. 41-110
    • Yu, S.1


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