Abstract
We prove that each context-flee language has a polynomial size test set. This improves the doubly exponential upper bound obtained in [ACK] and single exponential bound from [KRJ]. An efficient algorithm to find test sets for contextfree languages is also presented. The basic tools in the proof are graph-theoretical properties of test sets and periodicities in strings.
Cite
CITATION STYLE
Karhumäki, J., Plandowski, W., & Rytter, W. (1992). Polynomial size test sets for context-free languages. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 623 LNCS, pp. 53–64). Springer Verlag. https://doi.org/10.1007/3-540-55719-9_63
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
