1. Alfred V. Aho, Ravi Sethi, and Jeffrey D. Ullman. 1986. Compilers: principles, techniques, and tools. Addison-Wesley.
2. John Aycock and R. Nigel Horspool. 2001. Schrödinger’s token. Software: practice and experience 31, 8 (2001), 803 – 814.
3. Sylvie Billot and Bernard Lang. 1989. The Structure of Shared Forests in Ambiguous Parsing. In Proceedings of the 27th conference on Association for Computational Linguistics. Association for Computational Linguistics, 143–151.
4. J.-P. Chanod and P. Tapananeinen. 1996. A Non-deterministic Tokeniser for Finite-State Parsing. In ECAI 96. 12th European Conference on Artificial Intelligence, W. Wahlster (Ed.). JohnWiley & Sons, Ltd., 10–12.
5. J.-P. Chanod and P. Tapananeinen. 1999. Finite State Based Reductionist Parsing for French. In Extended Finite State Models of Languages, A. Kornai (Ed.). Cambridge University Press, 72–85.