Overlap-Free Regular Languages
We define a language to be overlap-free if any two distinct strings in the language do not overlap with each other. We observe that overlap-free languages are a proper subfamily of infix-free languages and also a proper subfamily of comma-free languages. Based on these observations, we design a polynomial-time algorithm that determines overlap-freeness of a regular language. We consider two cases: A language is specified by a nondeterministic finite-state automaton and a language is described by a regular expression. Furthermore, we examine the prime overlap-free decomposition of overlap-free regular languages and show that the prime overlap-free decomposition is not unique.
KeywordsRegular Expression Regular Language Prime Decomposition Bridge State Pair Graph
Unable to display preview. Download preview PDF.
- 1.Aho, A.: Algorithms for finding patterns in strings. In: van Leeuwen, J. (ed.) Algorithms and Complexity. Handbook of Theoretical Computer Science, vol. A, pp. 255–300. The MIT Press, Cambridge (1990)Google Scholar
- 13.Hopcroft, J., Ullman, J.: Formal Languages and Their Relationship to Automata. Addison-Wesley, Reading (1969)Google Scholar
- 14.IEEE: IEEE standard for information technology: Portable Operating System Interface (POSIX): part 2, shell and utilities. IEEE Computer Society Press, Los Alamitos (1993)Google Scholar
- 15.Jürgensen, H., Konstantinidis, S.: Codes. In: Rozenberg, G., Salomaa, A. (eds.) Word, Language, Grammar. Handbook of Formal Languages, vol. 1, pp. 511–607. Springer, Heidelberg (1997)Google Scholar
- 16.Mateescu, A., Salomaa, A., Yu, S.: On the decomposition of finite languages. Technical Report 222, TUCS (1998)Google Scholar