Polynomial size test sets for context-free languages

DOI10.1006/JCSS.1995.1002MaRDI QIDQ1892201zbMATH OpenOpenAlexFDO

Authors 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

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Polynomial size test sets for context-free languages
• Efficient constructions of test sets for regular and context-free languages
• scientific article; zbMATH DE number 176145
• Linear size test sets for certain commutative languages
• On the context-free production complexity of finite languages

Cited in

(11)

• On the size of independent systems of equations in semigroups
• A survey on decidable equivalence problems for tree transducers
• Linear size test sets for certain commutative languages
• More on the power of chain rules in context-free grammars
• Efficient constructions of test sets for regular and context-free languages
• Polynomial size test sets for commutative languages
• Polynomial size test sets for context-free languages
• On the size of independent systems of equations in semigroups
• Lower bounds for context-free grammars
• Automatic evaluation of context-free grammars (system description)
• scientific article; zbMATH DE number 176145 (Why is no real title available?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1892201)