An efficient automata approach to some problems on context-free grammars

This publication has 4 references indexed in Scilit:

• On the regular structure of prefix rewriting
  Theoretical Computer Science, 1992
• Linear-time algorithms for testing the satisfiability of propositional horn formulae
  The Journal of Logic Programming, 1984
• Recognition and parsing of context-free languages in time n3
  Information and Control, 1967
• Regular canonical systems
  Archive for Mathematical Logic, 1964