Data structures, algorithms, and performance
Data structures, algorithms, and performance
On language equations with invertible operations
Theoretical Computer Science
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
Theory of Computation: A Primer
Theory of Computation: A Primer
Introduction to Algorithms
Factorizations of languages and commutativity conditions
Acta Cybernetica
On the Decomposition of Finite Languages
On the Decomposition of Finite Languages
Prefix-Free regular-expression matching
CPM'05 Proceedings of the 16th annual conference on Combinatorial Pattern Matching
Outfix-free regular languages and prime outfix-free decomposition
ICTAC'05 Proceedings of the Second international conference on Theoretical Aspects of Computing
Fundamenta Informaticae
Computing forbidden words of regular languages
Fundamenta Informaticae - Computing Patterns in Strings
| Hi-index | 0.00 |
A string x is an outfix of a string y if there is a string w such that x$_1$wx$_2$ = y and x = x$_1$x$_2$. A set X of strings is outfix-free if no string in X is an outfix of any other string in X. Based on the properties of outfix strings, we develop a polynomial-time algorithm that determines outfix-freeness of regular languages. Note that outfix-free regular languages are always finite. We consider two cases: 1) a language is given as a finite set of strings and 2) a language is given by a finite-state automaton. Furthermore, we investigate the prime outfix-free decomposition of outfixfree regular languages and design a linear-time algorithm that computes prime outfix-free decomposition for outfix-free regular languages. We also demonstrate the uniqueness of prime outfix-free decomposition.