Parikh test sets for commutative languages

A set T L is a Parikh test set of L iff c(T ) is a test set of c(L). We give an effective characterization of Parikh test sets for arbitrary commutative language.

• Type: Journal
• Year: 2008
• Where: ITA
• Authors: Stepan Holub
• Keywords: Arbitrary Commutative Language, Communications, Effective Characterization, ITA 2008, Parikh Test