Polynomial size test sets for context-free languages

DOI10.1006/JCSS.1995.1002zbMATH Open0834.68065OpenAlexW2004053658MaRDI QIDQ1892201FDOQ1892201

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

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

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cited In (11)

• On the size of independent systems of equations in semigroups
• Efficient constructions of test sets for regular and context-free languages
• Automatic evaluation of context-free grammars (system description)
• Polynomial size test sets for context-free languages
• Linear size test sets for certain commutative languages
• On the size of independent systems of equations in semigroups
• More on the power of chain rules in context-free grammars
• Lower bounds for context-free grammars
• Polynomial size test sets for commutative languages
• A survey on decidable equivalence problems for tree transducers
• Title not available (Why is that?)

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)