THE EDIT-DISTANCE BETWEEN A REGULAR LANGUAGE AND A CONTEXT-FREE LANGUAGE
From MaRDI portal
Publication:5495420
DOI10.1142/S0129054113400315zbMATH Open1293.68187MaRDI QIDQ5495420FDOQ5495420
Sang-Ki Ko, Kai Salomaa, Yo-Sub Han
Publication date: 4 August 2014
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Cites Work
- Distances between languages and reflexivity of relations
- Computing the edit distance of a regular language
- EDIT-DISTANCE OF WEIGHTED AUTOMATA: GENERAL DEFINITIONS AND ALGORITHMS
- The String-to-String Correction Problem
- Order- n correction for regular languages
- Programming Techniques: Regular expression search algorithm
- How hard is computing the edit distance?
- Büchi context-free languages
Cited In (17)
- Decidability of involution hypercodes
- Approximate matching between a context-free grammar and a finite-state automaton
- State Complexity of Neighbourhoods and Approximate Pattern Matching
- Input-driven pushdown automata for edit distance neighborhood
- Prefix Distance Between Regular Languages
- Edit-Distance Between Visibly Pushdown Languages
- Parameterized Prefix Distance between Regular Languages
- Weak inverse neighborhoods of languages
- Absent Subsequences in Words
- Consensus string problem for multiple regular languages
- Quasi-Distances and Weighted Finite Automata
- Descriptional Complexity of Error Detection
- Computing the Shortest String and the Edit-Distance for Parsing Expression Languages
- Consensus String Problem for Multiple Regular Languages
- State Complexity of Neighbourhoods and Approximate Pattern Matching
- State Complexity of Suffix Distance
- Approximating Language Edit Distance Beyond Fast Matrix Multiplication: Ultralinear Grammars Are Where Parsing Becomes Hard!
This page was built for publication: THE EDIT-DISTANCE BETWEEN A REGULAR LANGUAGE AND A CONTEXT-FREE LANGUAGE
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5495420)
