With this poster, the authors on the denotational semantics of algorithms to suggest an abstraction of a string recognizer. The abstraction provides a unified formalism for representing FA-based string recognizers as an instance of a parameterized function. It also forms the basis for theoretical investigations on implementations of FA-based recognizers, and represents a framework for the identification of new algorithms for further studies.
Reference:
Ngassam, EK, Watson, BW and Kourie, DG. 2010. Formal characterizations of FA-based string processors. PSC 2010: Proceedings of the Prague Stringology Conference 2010, Prague, 30 August - 1 September, 2010,pp 3
Ngassam, E., Watson, B., & Kourie, D. (2010). Formal characterizations of FA-based string processors. http://hdl.handle.net/10204/4670
Ngassam, EK, BW Watson, and DG Kourie. "Formal characterizations of FA-based string processors." (2010): http://hdl.handle.net/10204/4670
Ngassam E, Watson B, Kourie D, Formal characterizations of FA-based string processors; 2010. http://hdl.handle.net/10204/4670 .
