Descendants of Regular Language in a Class of Rewriting Systems: Algorithm and Complexity of an Automata Construction.

M. Benois Descendants of Regular Language in a Class of Rewriting Systems: Algorithm and Complexity of an Automata Construction. 121-132 1987 conf/rta/87 RTA db/conf/rta/rta87.html#Benois87 http://dx.doi.org/10.1007/3-540-17220-3_11