Welcome to IEEE Xplore 2.0: Automata for Weak Factor Recognition

Cart | Sitemap | Help

Abstract


	BROWSE	SEARCH	IEEE XPLORE GUIDE	SUPPORT

View TOC |

Previous Article | Next Article

Automata for Weak Factor Recognition
Meng Zhang Yi Zhang Kuo Zhao Liang Hu
Coll. of Comput. Sci. & Technol., Jilin Univ., Changchun;

This paper appears in: Young Computer Scientists, 2008. ICYCS 2008. The 9th International Conference for
Publication Date: 18-21 Nov. 2008
On page(s): 1771-1776
Location: Hunan,
ISBN: 978-0-7695-3398-8
INSPEC Accession Number: 10424038
Digital Object Identifier: 10.1109/ICYCS.2008.395
Current Version Published: 2008-12-12

Abstract
In this paper, a family of automata for weak factor recognition named weak factor automaton (WFA) is introduced. WFAs can at least recognize the factors of a word and have similar properties of the factor oracle. WFAs are not always acyclic and the acyclic WFA is equivalent to the factor oracle with redundant edges. Based on the same approach, a new weight automaton for precise full-text index is introduced. A simple linear on-line construction algorithm for these two classes of automata is also given.

Index Terms
Available to subscribers and IEEE members.

References
Available to subscribers and IEEE members.

Citing Documents
Available to subscribers and IEEE members.

You are not logged in.

Guests may access Abstract records free of charge.