1. Charatonik, W.: Set constraints in some equational theories. Information and Computation 142(1), 40–75 (1998)
2. Jeż, A., Okhotin, A.: Conjunctive grammars over a unary alphabet: undecidability and unbounded growth. Theory of Computing Systems (to appear)
3. Lecture Notes in Computer Science;A. Jeż,2008
4. Jeż, A., Okhotin, A.: Equations over sets of natural numbers with addition only. In: STACS 2009, Freiburg, Germany, February 26-28, 2009, pp. 577–588 (2009)
5. Kunc, M.: The power of commuting with finite sets of words. Theory of Computing Systems 40(4), 521–551 (2007)