M. Benois. Descendants of Regular Language in a Class of Rewriting Systems: Algorithm and Complexity of an Automata Construction. In Pierre Lescanne, editor, Rewriting Techniques and Applications, 2nd International Conference, RTA-87, Bordeaux, France, May 25-27, 1987, Proceedings. Volume 256 of Lecture Notes in Computer Science, pages 121-132, Springer, 1987.
No reviews for this publication, yet.