Additive Distances and Quasi_Distances Between Words
| dc.creator | Calude,Cristian S. | |
| dc.creator | Salomaa,Kai | |
| dc.creator | Yu,Sheng | |
| dc.date | 2002 | |
| dc.date.accessioned | 2024-02-06T12:51:38Z | |
| dc.date.available | 2024-02-06T12:51:38Z | |
| dc.description | We study additive distances and quasi-distances between words. We show that every additive distance is finite. We then prove that every additive quasi-distance is regularity-preserving, that is, the neighborhood of any radius of a regular language with respect to an additive quasi-distance is regular. Finally, similar results will be proven for context-free, computable and computably enumerable languages. 1.) C. S. Calude, K. Salomaa, S. Yu (eds.). Advances and Trends in Automata and Formal Languages. A Collection of Papers in Honour of the 60th Birthday of Helmut Jürgensen. | |
| dc.format | text/html | |
| dc.identifier | https://doi.org/10.3217/jucs-008-02-0141 | |
| dc.identifier | https://lib.jucs.org/article/27849/ | |
| dc.identifier.uri | https://openrepository.mephi.ru/handle/123456789/8101 | |
| dc.language | en | |
| dc.publisher | Journal of Universal Computer Science | |
| dc.relation | info:eu-repo/semantics/altIdentifier/eissn/0948-6968 | |
| dc.relation | info:eu-repo/semantics/altIdentifier/pissn/0948-695X | |
| dc.rights | info:eu-repo/semantics/openAccess | |
| dc.rights | J.UCS License | |
| dc.source | JUCS - Journal of Universal Computer Science 8(2): 141-152 | |
| dc.subject | some words | |
| dc.title | Additive Distances and Quasi_Distances Between Words | |
| dc.type | Research Article |