3 search results - page 1 / 1 » Parikh test sets for commutative languages |
ITA
2008
13 years 4 months ago
2008
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.
ICALP
2007
Springer
13 years 11 months ago
2007
Springer
Exploring a graph through search is one of the most basic building blocks of various applications. In a setting with a huge state space, such as in testing and verification, optim...
LICS
2010
IEEE
13 years 3 months ago
2010
IEEE
We consider formulas which, in addition to the symbols in the vocabulary, may use two designated symbols ≺ and + that must be interpreted as a linear order and its associated ad...