IEEE - Institute of Electrical and Electronics Engineers, Inc. - NFAs with tagged transitions, their conversion to deterministic automata and application to regular expressions

Proceedings of SPIRE'2000 - String Processing and Information Retrieval

Author(s): Laurikari, V.
Publisher: IEEE - Institute of Electrical and Electronics Engineers, Inc.
Publication Date: 1 January 2000
Conference Location: A Curuna, Spain
Conference Date: 29 September 2000
Page(s): 181 - 187
ISBN (Paper): 0-7695-0746-8
DOI: 10.1109/SPIRE.2000.878194
Regular:

A conservative extension to traditional nondeterministic finite automata (NFAs) is proposed to keep track of the positions in the input string for the last uses of selected transitions, by adding... View More

Advertisement