![]() | ![]() |
1987 | ||
---|---|---|
2 | M. Benois: Descendants of Regular Language in a Class of Rewriting Systems: Algorithm and Complexity of an Automata Construction. RTA 1987: 121-132 | |
1986 | ||
1 | M. Benois, Jacques Sakarovitch: On the Complexity of Some Extended Word Problems Defined by Cancellation Rules. Inf. Process. Lett. 23(6): 281-287 (1986) |
1 | Jacques Sakarovitch | [1] |