Name
Abstract | ||
|---|---|---|
Let Σ be an arbitrary fixed alphabet. The direct copying relation (over Σ + ) is a binary relation defined by: x copy y if and only if x = x 1 ux 2 and y = x 1 uux 2 for some words x 1 , x 2 , u where u is nonempty. The copying relation copy ∗ is defined as the reflexive and transitive closure of copy. A copying system is an ordered pair G = ( Σ , w ) where w ϵΣ + ; its language is L(G) = {zϵΣ + : w copy ∗ z} , it is referred to as a copy language . This note provides a sufficient condition for a copy language to be regular; an application of this condition is demonstrated. |
Year | DOI | Venue |
|---|---|---|
1984 | 10.1016/0166-218X(84)90129-X | DISCRETE APPLIED MATHEMATICS |
Field | DocType | Volume |
Discrete mathematics,Combinatorics,Binary relation,Ordered pair,Copying,If and only if,Transitive closure,Mathematics,Alphabet | Journal | 8 |
Issue | ISSN | Citations |
3 | 0166-218X | 10 |
PageRank | References | Authors |
1.59 | 5 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| A. Ehrenfeucht | 1 | 1823 | 497.83 |
| G. Rozenberg | 2 | 298 | 64.16 |