The Finite-State Automata's Design Patterns

Pedrazzini, Sandro (1999) The Finite-State Automata's Design Patterns. In: Champarnaud, Jean-Marc and Maurel, Denis and Ziadi, Djelloul, (eds.) Automata Implementation. Lecture Notes in Computer Science (1660). Springer, p. 213.

Full text not available from this repository.


This chapter discusses the design patterns used and proposed for the realization of finite state automata. Various aspects in the design of a framework for the implementation of FSA will be treated, presenting not only the patterns for the single components, but the entire system design. Using design patterns to sketch a framework means performing an "abstract implementation", from which it is possible to realize concrete specific automata, simply customizing some classes. In order to test the framework, some concrete lexical tools have been created. The resulting automata and transducers are used to perform word form analysis, word form generation, creation and derivation history, spellchecking and phrase recognition.

Actions (login required)

View Item View Item