Book Chapter

Combining Regular Expressions with Near-Optimal Automata in the FIRE Station Environment

Bruce W. Watson, Michiel Frishert, Loek Cleophas 2005/08 - Book Chapter

Arppe, Carlson, Heinamaki, Linden, Miestamo, Piitulainen, Tupakka, Westerlund, Yli-Jyra (eds.), A Finnish Computer Linguist: Kimmo Koskenniemi Festschrift on the 60th birthday, CSLI Publications, August 2005, pp. 169-177.

(show/hide) Abstract

We discuss a method for efficiently computing deterministic Brzozowski (derivatives) automata. Our approach is based on efficiently storing regular expressions using parse trees and expressions using common subexpression elimination.

A new recursive incremental algorithm for building minimal acyclic deterministic finite automata

Bruce W. Watson 2003/01 - Book Chapter

Carlos Martin-Vide and Victor Mitrana (eds.), Grammars and Automata for String Processing: From Mathematics and Computer Science to Biology, and Back, Taylor and Francis, January 2003, pp. 189-200.

Implementing and using finite automata toolkits

Bruce W. Watson 1999/00 - Book Chapter

András Kornai (ed.), Extended Finite State Models of Language, Cambridge University Press, 1999.

A Boyer-Moore (or Watson-Watson) type algorithm for regular tree pattern matching

Bruce W. Watson 1995/00 - Book Chapter

E.H.L. Aarts, H.M.M. ten Eikelder, C. Hemerik, and M. Rem (eds.), Simplex Sigillum Veri: Een Liber Amicorum voor prof.dr. F.E.J. Kruseman Aretz, Department of Computing Science, Eindhoven University of Technology, The Netherlands, 1995, pp. 315-320.