Incremental and semi-incremental construction of pseudo-minimal automata

Authors:
Jan Daciuk;Denis Maurel;Agata Savary
Affiliations:
Gdańsk University of Technology, Poland;Université François Rabelais, Tours, France;Université François Rabelais, Tours, France
Venue:
CIAA'05 Proceedings of the 10th international conference on Implementation and Application of Automata
Year:
2005

Citing 3
Cited 2

Psuedo-minimal transducer

Theoretical Computer Science - Special issue on implementing automata
A Fast New Semi-incremental Algorithm for the Construction of Minimal Acyclic DFAs

WIA '98 Revised Papers from the Third International Workshop on Automata Implementation
Incremental construction of minimal acyclic finite-state automata

Computational Linguistics - Special issue on finite-state methods in NLP

On building minimal automaton for subset matching queries

Information Processing Letters
Smaller representation of finite state automata

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

Pseudo-minimal automata ([1],[2]) are minimal acyclic automata that have a proper element (a transition or a state) for each word belonging to the language of the automaton. That proper element is not shared with any other word, and it can be used for implementing a function on words belonging to the language. For instance, dynamic perfect hashing (e.g. a mapping from n unique words to n consecutive numbers, such that addition of new elements does not change the order of the previous elements) can be implemented using a pseudo-minimal automaton ([3]).