scientific article; zbMATH DE number 1916668

MaRDI QIDQ4807828zbMATH OpenFDO

Authors Daniel-Claudian Voinescu

Publication date 26 May 2003

zbMATH Keywords

combinatorial degree

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Linear size test sets for certain commutative languages
• Polynomial size test sets for commutative languages
• Factorial Languages of Low Combinatorial Complexity
• Parikh test sets for commutative languages
• Efficient constructions of test sets for regular and context-free languages

Cited in

(1)

• Parikh test sets for commutative 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 Q4807828)