| |
Browse All Reviews > Theory Of Computation (F) > Mathematical Logic And Formal Languages (F.4) > Formal Languages (F.4.3) > Operations On Languages (F.4.3...)
|
|
 |
|
|
| |
|
|
| |
1-9 of 9
Reviews about "Operations On Languages (F.4.3...)":
|
Date Reviewed |
| |
Operations preserving regular languages
Berstel J., Boasson L., Carton O., Petazzoni B., Pin J. Theoretical Computer Science 354(3): 405-420, 2006. Type: Article
Given a nonnegative strictly increasing sequence of integers s, a word is said to be filtered by s when its letters in the positions denoted by the integers in s are isolated fro...
|
Aug 17 2006 |
| |
Implicit language equations
Leiss E. Theoretical Computer Science 145(1-2): 71-93, 1995. Type: Article
The author introduces a new type of language equations, called “implicit equations,” and shows that the behavior of implicit equations differs significantly from that of conventional ones. An algorithm for determini...
|
Sep 1 1996 |
| |
Equations and monoid varieties of dot-depth one and two
Blanchet-Sadri F. Theoretical Computer Science 123(2): 239-258, 1994. Type: Article
Every variety of monoids is ultimately defined by a sequence of equations, and every variety of monoids generated by a single monoid is defined by a finite or infinite sequence of equations. The main purpose of this paper is to study t...
|
Aug 1 1995 |
| |
Extended regular expressions of arbitrary star degrees
Yoo H., Hashiguchi K. Theoretical Computer Science 97(2): 217-231, 1992. Type: Article
Operations that generalize Kleene star were introduced and studied by the authors in previous papers [1,2]. This paper extends the study to “star operators of degree ≥ 3.” The family of extended regular langu...
|
Jun 1 1993 |
| |
Extended automata-like regular expressions of star degree at most (2,1)
Yoo H., Hashiguchi K. Theoretical Computer Science 88(2): 351-363, 1991. Type: Article
In a previous paper, the authors introduced the operation ** [1]. This paper introduces the “star operation of degree (2,1),” which is a generalization of **. The family of extended automata-like regular languages (...
|
Sep 1 1992 |
| |
The zig-zag power series
Anselmo M. Theoretical Computer Science 79(1): 3-24, 1991. Type: Article
In an earlier paper, the author introduced a modified version of the Kleene star operation. It associates with a language X the set X↑ of all words that can be traversed in a zigzag manner...
|
Jan 1 1992 |
| |
Semi-commutations
Clerbout M., Latteux M. Information and Computation 73(1): 59-74, 1987. Type: Article
This paper follows [1] and [2], in which the notion of partial commutation is examined. Given a Thue system S = ( X , P ) (where X is a finite alphabet and P is a set of symmetri...
|
Nov 1 1987 |
| |
Inverse morphic equivalence on languages
Karhumäki J., Wood D. Information Processing Letters 19(5): 213-218, 1984. Type: Article
Let h: &Sgr;* → &Dgr;* be a morphism of free monoids. The inverse mapping h − 1 is the mapping of &Dgr; * in the set P ( &Sgr;* ) of subsets of &Sgr;* defined by h
|
Sep 1 1985 |
| |
The Ehrenfeucht conjecture: a compactness claim for finitely generated free monoids
Karhumaki J. Theoretical Computer Science 29(3): 285-308, 1984. Type: Article
The following was conjectured by A. Ehrenfeucht in the early 1970s: For each language L over a finite alphabet &Sgr; there exists a finite subset F of L such that, for each p...
|
May 1 1985 |
| |
|
|
| |
|
|
