ResearchSpace

Formal characterizations of FA-based string processors

Show simple item record

dc.contributor.author Ngassam, EK
dc.contributor.author Watson, BW
dc.contributor.author Kourie, DG
dc.date.accessioned 2010-12-14T12:25:06Z
dc.date.available 2010-12-14T12:25:06Z
dc.date.issued 2010-08
dc.identifier.citation 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 en
dc.identifier.isbn 978-80-01-044597-8
dc.identifier.uri http://hdl.handle.net/10204/4670
dc.description PSC 2010: Proceedings of the Prague Stringology Conference 2010, Prague, 30 August - 1 September, 2010 en
dc.description.abstract 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. en
dc.language.iso en en
dc.relation.ispartofseries Conference Paper en
dc.subject FA-based string recognizers en
dc.subject Algorithms en
dc.subject String recognizers en
dc.subject Stringology en
dc.title Formal characterizations of FA-based string processors en
dc.type Conference Presentation en
dc.identifier.apacitation Ngassam, E., Watson, B., & Kourie, D. (2010). Formal characterizations of FA-based string processors. http://hdl.handle.net/10204/4670 en_ZA
dc.identifier.chicagocitation Ngassam, EK, BW Watson, and DG Kourie. "Formal characterizations of FA-based string processors." (2010): http://hdl.handle.net/10204/4670 en_ZA
dc.identifier.vancouvercitation Ngassam E, Watson B, Kourie D, Formal characterizations of FA-based string processors; 2010. http://hdl.handle.net/10204/4670 . en_ZA
dc.identifier.ris TY - Conference Presentation AU - Ngassam, EK AU - Watson, BW AU - Kourie, DG AB - 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. DA - 2010-08 DB - ResearchSpace DP - CSIR KW - FA-based string recognizers KW - Algorithms KW - String recognizers KW - Stringology LK - https://researchspace.csir.co.za PY - 2010 SM - 978-80-01-044597-8 T1 - Formal characterizations of FA-based string processors TI - Formal characterizations of FA-based string processors UR - http://hdl.handle.net/10204/4670 ER - en_ZA


Files in this item

Thumbnail
Name: Ngassam_2010.pdf
Size: 58.89Kb
Format: PDF
View/Open

This item appears in the following Collection(s)

Show simple item record