scientific article; zbMATH DE number 176145

zbMATH Open0776.68073MaRDI QIDQ4035247FDOQ4035247

Authors: Juhani Karhumäki, Stefan Jarominek, Wojciech Rytter 

Publication date: 18 May 1993

Title of this publication is not available (Why is that?)

Recommendations

• Efficient constructions of test sets for regular and context-free languages
• Linear size test sets for certain commutative languages
• Polynomial size test sets for context-free languages
• Testing the equivalence of regular languages
• Polynomial size test sets for context-free languages

zbMATH Keywords

regular languagestest setscontext free languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cited In (11)

• On the structure and complexity of rational sets of regular languages
• Efficient constructions of test sets for regular and context-free languages
• EFFICIENT DETECTORS AND CONSTRUCTORS FOR SIMPLE LANGUAGES
• Single-valuedness of tree transducers is decidable in polynomial time
• Polynomial size test sets for context-free languages
• Linear size test sets for certain commutative languages
• Title not available (Why is that?)
• Multiplicities: A deterministic view of nondeterminism
• Explicit test sets for iterated morphisms in free monoids and metabelian groups
• Test sets for the universal and existential closure of regular tree languages.
• Polynomial size test sets for context-free languages

This page was built for publication:

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