Polynomial size test sets for context-free languages
From MaRDI portal
Publication:1892201
DOI10.1006/jcss.1995.1002zbMath0834.68065MaRDI QIDQ1892201
Juhani Karhumäki, Wojciech Plandowski, Wojciech Rytter
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
68Q45: Formal languages and automata
Related Items
Polynomial size test sets for commutative languages, On the size of independent systems of equations in semigroups