المؤلفون: Andrei, Ştefan, Chin, Wei Ngan

مصطلحات موضوعية: reduction of a context-free grammar, one-letter context-free language, regular expression

وصف الملف: 101341 bytes; application/pdf

العلاقة: Computer Science (CS)

الإتاحة: http://hdl.handle.net/1721.1/3865Test

المؤلفون: Salvador V. Cavadini, Wei-Ngan Chin, Stefan Andrei

المصدر: Theoretical Computer Science. 306(1-3):113-122

مصطلحات موضوعية: General Computer Science, Computer Science::Computation and Language (Computational Linguistics and Natural Language and Speech Processing), Context-free grammar, Constructive, Theoretical Computer Science, Regular expression, Algebra, Tree-adjoining grammar, One-letter context-free language, Reduction of a context-free grammar, Formal language, Stochastic context-free grammar, Regular grammar, L-attributed grammar, Algorithm, Computer Science::Formal Languages and Automata Theory, Mathematics, Computer Science(all)

الوصول الحر: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::526e2cea6226799867ad140ba94885e6Test

المؤلفون: Andrei, Å tefan, Chin, Wei Ngan

مصطلحات موضوعية: reduction of a context-free grammar, one-letter context-free language, regular expression

وصف الملف: 101341 bytes; application/pdf

العلاقة: Computer Science (CS); http://hdl.handle.net/1721.1/3865Test

الإتاحة: http://hdl.handle.net/1721.1/3865Test

المؤلفون: Andrei, S., Cavadini, S.V., Chin, W.-N.

المساهمون: SINGAPORE-MIT ALLIANCE, COMPUTER SCIENCE

المصدر: Scopus

مصطلحات موضوعية: One-letter context-free language, Reduction of a context-free grammar, Regular expression

العلاقة: Andrei, S., Cavadini, S.V., Chin, W.-N. (2003). A new algorithm for regularizing one-letter context-free grammars. Theoretical Computer Science 306 (1-3) : 113-122. ScholarBank@NUS Repository. https://doi.org/10.1016/S0304-3975Test(03)00215-9; http://scholarbank.nus.edu.sg/handle/10635/43149Test; 000185261500008

الإتاحة: https://doi.org/10.1016/S0304-3975Test(03)00215-9
http://scholarbank.nus.edu.sg/handle/10635/43149Test

مصطلحات الفهرس: reduction of a context-free grammar, one-letter context-free language, regular expression, Article

URL: http://hdl.handle.net/1721.1/3865Test
Computer Science (CS)