Prefix Distance Between Regular Languages

DOI10.1007/978-3-319-40946-7_19zbMath1475.68165OpenAlexW2505585244MaRDI QIDQ2830223

Timothy Ng

Publication date: 9 November 2016

Published in: Implementation and Application of Automata (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-40946-7_19

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (3)

When variable-length codes meet the field of error detection ⋮ Finite Approximations and Similarity of Languages ⋮ Efficient algorithms for computing the inner edit distance of a regular language via transducers

Cites Work

• Unnamed Item
• Unnamed Item
• Bounded repairability of word languages
• Handbook of weighted automata
• Distances between languages and reflexivity of relations
• How hard is computing the edit distance?
• Computing the edit distance of a regular language
• The per-character cost of repairing word languages
• Parameterized Prefix Distance between Regular Languages
• Computing Maximal Error-detecting Capabilities and Distances of Regular Languages
• String distances and intrusion detection: Bridging the gap between formal languages and computer security
• A Second Course in Formal Languages and Automata Theory
• THE EDIT-DISTANCE BETWEEN A REGULAR LANGUAGE AND A CONTEXT-FREE LANGUAGE
• EDIT-DISTANCE OF WEIGHTED AUTOMATA: GENERAL DEFINITIONS AND ALGORITHMS
• Encyclopedia of Distances

This page was built for publication: Prefix Distance Between Regular Languages