Parikh test sets for commutative languages

DOI10.1051/ita:2008011zbMath1149.68068OpenAlexW2114372485MaRDI QIDQ3526415

Š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

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

Cites Work

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

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