1. Miguel A. Alonso, Víctor J. Díaz, and Manuel Vilares. Bidirectional automata for tree adjoining grammars. In Proc. of the Seventh International Workshop on Parsing Technologies (IWPT-2001), pages 42–53, Beijing, China, October 2001. Tsinghua University Press.
2. Eric de la Clergerie. Automates à Piles et Programmation Dynamique. DyALog: Une Application à la Programmation en Logique. PhD thesis, Université Paris 7, Paris, France, 1993.
3. Eric de la Clergerie and Bernard Lang. LPDA: Another look at tabulation in logic programming. In Van Hentenryck, editor, Proc. of the 11th International Conference on Logic Programming (ICLP’94), pages 470–486. MIT Press, June 1994.
4. J. Earley. An efficient context-free parsing algorithm. Communications of the ACM, 13(2):94–102, 1970.
5. Bernard Lang. Towards a uniform formal framework for parsing. In Masaru Tomita, editor, Current Issues in Parsing Technology, pages 153–171. Kluwer Academic Publishers, Norwell, MA, USA, 1991.