Polynomial size test sets for context-free languages

This publication has 8 references indexed in Scilit:

• Efficient constructions of test sets for regular and context-free languages
  Published by Springer Nature ,1991
• On recent trends in formal language theory
  Lecture Notes in Computer Science, 1987
• A proof of Ehrenfeucht's Conjecture
  Theoretical Computer Science, 1985
• The Ehrenfeucht conjecture: a compactness claim for finitely generated free monoids
  Theoretical Computer Science, 1984
• Test sets for context free languages and algebraic systems of equations over a free monoid
  Information and Control, 1982
• Test sets and checking words for homomorphism equivalence
  Journal of Computer and System Sciences, 1980
• HOMOMORPHISMS: DECIDABILITY, EQUALITY AND TEST SETS1
  Published by Elsevier ,1980
• On the decidability of homomorphism equivalence for languages
  Journal of Computer and System Sciences, 1978