2019
DOI: 10.1007/978-3-030-24886-4_9
|View full text |Cite
|
Sign up to set email alerts
|

The Relative Edit-Distance Between Two Input-Driven Languages

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2019
2019
2022
2022

Publication Types

Select...
1
1
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(1 citation statement)
references
References 17 publications
0
1
0
Order By: Relevance
“…One of the most classical and well-understood string-problems is computing the edit distance between words [44], for which an optimal (up to poly-logarithmic factors) solution exists [1,47]. The problem of computing the edit distance between a word and a language, or between two languages, is also a well-studied problem, in various settings (see, e.g., [6,9,10,28,33]).…”
Section: Introductionmentioning
confidence: 99%
“…One of the most classical and well-understood string-problems is computing the edit distance between words [44], for which an optimal (up to poly-logarithmic factors) solution exists [1,47]. The problem of computing the edit distance between a word and a language, or between two languages, is also a well-studied problem, in various settings (see, e.g., [6,9,10,28,33]).…”
Section: Introductionmentioning
confidence: 99%