Polynomial size test sets for context-free languages
From MaRDI portal
Publication:1892201
DOI10.1006/jcss.1995.1002zbMath0834.68065OpenAlexW2004053658MaRDI QIDQ1892201
Wojciech Plandowski, Wojciech Rytter, Juhani Karhumäki
Publication date: 18 March 1996
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jcss.1995.1002
Related Items (4)
On the size of independent systems of equations in semigroups ⋮ Polynomial size test sets for commutative languages ⋮ A Survey on Decidable Equivalence Problems for Tree Transducers ⋮ On the size of independent systems of equations in semigroups
This page was built for publication: Polynomial size test sets for context-free languages
