Name
Abstract | ||
|---|---|---|
We consider the decision problem of whether or not a given regular language is maximal with respect to certain combined types of code properties. In the recent past, there have been a few formal methods for defining code properties, such as the trajectory-based type of codes and the transducer-based type of codes, that allow one to decide the maximality problem, including the case where maximality is tested with respect to combined properties within these formal methods. The property of ''deciphering delay 1'', also known as decoding delay 1, is not known to be definable with these methods, but it is known that the maximality of this property alone is decidable for regular languages. Here, we consider the problem of deciding maximality of a regular language with respect to deciphering delay 1 and a transducer-based property, such as suffix code, overlap-free language, and error-detection properties. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1016/j.tcs.2014.07.015 | Theoretical Computer Science |
Keywords | DocType | Volume |
deciphering delay,code properties,maximal codes,decidable,decoding delay,syntactic monoids | Journal | 550 |
Issue | ISSN | Citations |
1 | 0304-3975 | 1 |
PageRank | References | Authors |
0.37 | 12 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Lila Kari | 1 | 1123 | 124.45 |
| Stavros Konstantinidis | 2 | 283 | 31.10 |
| Steffen Kopecki | 3 | 68 | 9.97 |