scispace - formally typeset
Journal ArticleDOI

n-Prefix–suffix languages ∗

Masami Ito, +3 more
- 01 Jan 1989 - 
- Vol. 30, pp 37-56
TLDR
The combinatorial structure of n-prefix-suffix languages, called n-ps-codes in this paper, is investigated.
Abstract: 
The combinatorial structure of n-prefix-suffix languages, called n-ps-codes in this paper, is investigated. An n-ps-code is a language, each of whose subsets of cardinality at most n is a prefix code or a suffix code.

read more

Citations
More filters
Journal ArticleDOI

Outfix and infix codes and related classes of languages

Masami Ito, +3 more
- 01 Dec 1991 - 
TL;DR: In this article, the authors derive properties of infix and outfix codes which describe their relation to other classes of codes and determine their combinatorial structures, including maximal codes, maximal codes within these classes, the syntactic monoids of such codes, and the connection of these codes with binary relations on the free monoid.
Journal ArticleDOI

Infix-free regular expressions and languages

Yo-Sub Han, +2 more
- 01 Apr 2006 - 
TL;DR: This work observes the structural properties of finite-state automata for infix-free languages and develops a polynomial-time algorithm to determine infIX-freeness of regular languages.
Journal ArticleDOI

Relations on free monoids, their independent sets, and codes

Helmut Jürgensen, +1 more
- 01 Jan 1991 - 
TL;DR: This theory provides a framework in which known results about codes can be expressed elegantly and in which several new results are derived and can be generalized to relations of arbitrary finite arity in a very natural fashion.
Journal ArticleDOI

K-Comma Codes and Their Generalizations

Bo Cui, +2 more
- 01 Jan 2011 - 
TL;DR: The notion of k-comma codes is introduced - a proper generalization of the notion of comma-free codes, and several hierarchical relationships among the families of n-k-commas intercodes are introduced, as well as a characterization of the family of 1-k.comma intercodes.
Proceedings Article

State complexity of prefix-free regular languages

Yo-Sub Han, +2 more
TL;DR: It is demonstrated that the state complexities of intersection and union operations based on the structural properties of prefix-free minimal DFAs can be reduced.