4 papers:
TACAS-2014-ChenCFNO #proving #safety- Proving Nontermination via Safety (HYC, BC, CF, KN, PWO), pp. 156–171.
ICALP-1991-Hashiguchi #algorithm #generative #regular expression- Algorithms for Determining the Smallest Number of Nonterminals (States) Sufficient for Generating (Accepting) a Regular Language (KH), pp. 641–648.
ICALP-1986-HermannP #algorithm #on the- On Nontermination of Knuth-Bendix Algorithm (MH, IP), pp. 146–156.
ICALP-1974-EhrenfeuchtR #morphism #term rewriting #trade-off- Trade-off between the Use of Nonterminals, Codings and Homomorphisms in Defining Languages for Some Classes of Rewriting Systems (AE, GR), pp. 473–480.