Prefix distance between regular languages
From MaRDI portal
Recommendations
Cites work
- A Second Course in Formal Languages and Automata Theory
- Bounded repairability of word languages
- Computing maximal error-detecting capabilities and distances of regular languages
- Computing the edit distance of a regular language
- Distances between languages and reflexivity of relations
- EDIT-DISTANCE OF WEIGHTED AUTOMATA: GENERAL DEFINITIONS AND ALGORITHMS
- Encyclopedia of Distances
- Handbook of weighted automata
- How hard is computing the edit distance?
- scientific article; zbMATH DE number 2201366 (Why is no real title available?)
- Introduction to algorithms
- Parameterized Prefix Distance between Regular Languages
- String distances and intrusion detection: Bridging the gap between formal languages and computer security
- The edit-distance between a regular language and a context-free language
- The per-character cost of repairing word languages
Cited in
(6)- Distances between languages and reflexivity of relations
- Efficient algorithms for computing the inner edit distance of a regular language via transducers
- Relative prefix distance between languages
- Parameterized Prefix Distance between Regular Languages
- When variable-length codes meet the field of error detection
- Finite Approximations and Similarity of Languages
This page was built for publication: Prefix distance between regular languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2830223)
