Prague Stringology Conference 2010
Ernest Ketcha Ngassam, Bruce W. Watson and Derrick G. Kourie
Formal Characterizations of FA-based String Processors
| Abstract: |
| We rely 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. |
| Download paper: |  |
 |
 |
| PostScript | BibTeX reference |