scientific article; zbMATH DE number 176145

MaRDI QIDQ4035247zbMATH OpenFDO

Authors Juhani Karhumäki, Stefan Jarominek, Wojciech Rytter

Publication date 18 May 1993

zbMATH Keywords

regular languagestest setscontext free languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

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

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
• scientific article; zbMATH DE number 777280 (Why is no real title available?)
• 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)