Edit distance neighbourhoods of input-driven pushdown automata
A Okhotin, K Salomaa - International Computer Science Symposium in …, 2017 - Springer
Edit distance ℓ-neighbourhood of a formal language is the set of all strings that can be
transformed to one of the strings in this language by at most ℓ insertions and deletions. Both …
transformed to one of the strings in this language by at most ℓ insertions and deletions. Both …
[HTML][HTML] Edit distance neighbourhoods of input-driven pushdown automata
A Okhotin, K Salomaa - Theoretical Computer Science, 2019 - Elsevier
Edit distance ℓ-neighbourhood of a formal language is the set of all strings that can be
transformed to one of the strings in this language by at most ℓ insertions and deletions. Both …
transformed to one of the strings in this language by at most ℓ insertions and deletions. Both …
Relative Prefix Distance Between Languages
The prefix distance between two words x and y is defined as the number of symbols in x and
y that do not belong to their longest common prefix. The relative prefix distance from a …
y that do not belong to their longest common prefix. The relative prefix distance from a …
State Complexity of Suffix Distance
The neighbourhood of a regular language with respect to the prefix, suffix and subword
distance is always regular and a tight bound for the state complexity of prefix distance …
distance is always regular and a tight bound for the state complexity of prefix distance …