Name
Title | ||
|---|---|---|
On Test Sets For Checking Morphism Equivalence On Languages With Fair Distribution Of Letters |
Abstract | ||
|---|---|---|
A test set for a language L is a finite subset T of L with the property that each pair of morphisms that agrees on T also agrees on L . Some results concerning test sets for languages with fair distribution of letters are presented. The first result is that every D0L language with fair distribution of letters has a test set. The second result shows that every language L with fair distribution has a test set relative to morphisms g , h which have bounded balance on L . These results are generalizations of results of Culik II and Karhumäki (1983). |
Year | DOI | Venue |
|---|---|---|
1984 | 10.1016/0304-3975(84)90089-6 | THEORETICAL COMPUTER SCIENCE |
DocType | Volume | Issue |
Journal | 33 | 2-3 |
ISSN | Citations | PageRank |
0304-3975 | 2 | 0.41 |
References | Authors | |
7 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yael Maon | 1 | 72 | 12.00 |
| Amiram Yehudai | 2 | 196 | 33.13 |