Parikh test sets for commutative languages

DOI10.1051/ITA:2008011MaRDI QIDQ3526415zbMATH OpenOpenAlexFDO

Authors Štěpán Holub

Publication date 25 September 2008

Published in RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/92886

zbMATH Keywords

test sets of quadratic size

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Combinatorics on words (68R15)

Recommendations

• Polynomial size test sets for commutative languages
• Linear size test sets for certain commutative languages
• scientific article; zbMATH DE number 1916668
• Polynomial size test sets for context-free languages
• Efficient constructions of test sets for regular and context-free languages

Cites work

• Linear size test sets for certain commutative languages
• Machines, languages, and complexity. 5th International meeting of young computer scientists, Smolenice, Czechoslovakia, November 14-18, 1988. Selected contributions. Proceedings
• Polynomial size test sets for commutative languages

Cited in

(4)

• Linear size test sets for certain commutative languages
• Polynomial size test sets for commutative languages
• scientific article; zbMATH DE number 1916668 (Why is no real title available?)
• A CHARACTERIZATION OF PARIKH SETS OF ET0L LANGUAGES IN TERMS OF P SYSTEMS

This page was built for publication: Parikh test sets for commutative languages

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