Polynomial size test sets for context-free languages

DOI10.1007/3-540-55719-9_63zbMath1425.68211OpenAlexW1507578430MaRDI QIDQ5204306

Juhani Karhumaäki, Wojciech Plandowski, Wojciech Rytter

Publication date: 4 December 2019

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-55719-9_63

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The Ehrenfeucht conjecture: A compactness claim for finitely generated free monoids
• A proof of Ehrenfeucht's conjecture
• Test sets and checking words for homomorphism equivalence
• On the decidability of homomorphism equivalence for languages
• Test sets for context free languages and algebraic systems of equations over a free monoid

This page was built for publication: Polynomial size test sets for context-free languages