Data structures, algorithms, and performance
Data structures, algorithms, and performance
On the use of regular expressions for searching text
ACM Transactions on Programming Languages and Systems (TOPLAS)
Handbook of formal languages, vol. 1
Structure of 3-infix-outfix maximal codes
Theoretical Computer Science
Information Processing Letters
Deterministic generalized automata
Theoretical Computer Science
Introduction to Algorithms
Factorizations of languages and commutativity conditions
Acta Cybernetica
On the Decomposition of Finite Languages
On the Decomposition of Finite Languages
Computing forbidden words of regular languages
Fundamenta Informaticae - Special issue on computing patterns in strings
Prefix-Free regular-expression matching
CPM'05 Proceedings of the 16th annual conference on Combinatorial Pattern Matching
Fundamenta Informaticae
Outfix-Free Regular Languages and Prime Outfix-Free Decomposition
Fundamenta Informaticae
Simple-regular expressions and languages
Journal of Automata, Languages and Combinatorics
Overlap-Free regular languages
COCOON'06 Proceedings of the 12th annual international conference on Computing and Combinatorics
Prime decomposition problem for several kinds of regular codes
ICTAC'06 Proceedings of the Third international conference on Theoretical Aspects of Computing
Fundamenta Informaticae
Outfix-Free Regular Languages and Prime Outfix-Free Decomposition
Fundamenta Informaticae
| Hi-index | 0.00 |
A string x is an outfix of a string y if there is a string w such that x1wx2=y, where x = x1x2 and a set X of strings is outfix-free if no string in X is an outfix of any other string in X. We examine the outfix-free regular languages. Based on the properties of outfix strings, we develop a polynomial-time algorithm that determines the outfix-freeness of regular languages. We consider two cases: A language is given as a set of strings and a language is given by an acyclic deterministic finite-state automaton. Furthermore, we investigate the prime outfix-free decomposition of outfix-free regular languages and design a linear-time prime outfix-free decomposition algorithm for outfix-free regular languages. We demonstrate the uniqueness of prime outfix-free decomposition.