DSpace
 

Researchspace >
General science, engineering & technology >
General science, engineering & technology >
General science, engineering & technology >

Please use this identifier to cite or link to this item: http://hdl.handle.net/10204/4670

Title: Formal characterizations of FA-based string processors
Authors: Ngassam, EK
Watson, BW
Kourie, DG
Keywords: FA-based string recognizers
Algorithms
String recognizers
Stringology
Issue Date: Aug-2010
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
Series/Report no.: Conference Paper
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.
Description: PSC 2010: Proceedings of the Prague Stringology Conference 2010, Prague, 30 August - 1 September, 2010
URI: http://hdl.handle.net/10204/4670
ISBN: 978-80-01-044597-8
Appears in Collections:High performance computing
Human language technologies
General science, engineering & technology

Files in This Item:

File Description SizeFormat
Ngassam_2010.pdf58.89 kBAdobe PDFView/Open
View Statistics

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

 

Valid XHTML 1.0! DSpace Software Copyright © 2002-2010  Duraspace - Feedback