Name
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. |
Year | Venue | Keywords |
|---|---|---|
2010 | PROCEEDINGS OF THE PRAGUE STRINGOLOGY CONFERENCE 2010 | algorithms |
Field | DocType | Citations |
Discrete mathematics,Computer science,Theoretical computer science,Artificial intelligence | Conference | 0 |
PageRank | References | Authors |
0.34 | 2 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ernest Ketcha Ngassam | 1 | 17 | 4.66 |
| Bruce W. Watson | 2 | 338 | 53.24 |
| Derrick G. Kourie | 3 | 223 | 33.10 |