Minimal separators of two words
Let u and v be two distinct words on the alphabet A. Let us call sep-min(u, v) the set of minimal length elements in A* which are subwords (subsequences) of one and only one of u and v. This article aims at defining an automaton recognizing sep-min(u, v).
In the case where u = va, a ε A, the complexity in time of the algorithm for constructing the automaton is O(¦u¦CardA). In the general case, the complexity is proportional to the product of the size of the automaton by the size of the alphabet.
KeywordsAlgorithms Combinatorics on words Automata and Formal Languages
Unable to display preview. Download preview PDF.
- AHO, A.V. Algorithms for Finding Patterns in Strings handbook of Theorical Computer Science, Vol A (1990) 257–300.Google Scholar
- EILENBERG, S., Automata, Languages and Machine, Vol A (Academic Press 1974).Google Scholar
- LOTHAIRE, M., Combinatorics on words (Addison-Weysley, Reading, MA, 1983).Google Scholar
- SIMON, I., An Algorithm to Distinguish Words efficiently by their Subwords, Personal Communication.Google Scholar
- WATERMAN, M.S., Mathemetical Methods for DNA Sequences, (CRC Press 1989).Google Scholar