Computing the Shortest String and the Edit-Distance for Parsing Expression Languages
From MaRDI portal
Recommendations
Cites work
- Computing the edit distance of a regular language
- Context-freeness of parsing expression languages is undecidable
- EDIT-DISTANCE OF WEIGHTED AUTOMATA: GENERAL DEFINITIONS AND ALGORITHMS
- Error detecting and error correcting codes
- scientific article; zbMATH DE number 1747449 (Why is no real title available?)
- scientific article; zbMATH DE number 3240929 (Why is no real title available?)
- Packrat parsing: simple, powerful, lazy, linear time
- Parsing algorithms with backtrack
- Parsing expression grammars: a recognition-based syntactic foundation
- State complexity of neighbourhoods and approximate pattern matching
- The edit-distance between a regular language and a context-free language
- Unambiguous Boolean grammars
Cited in
(6)- Approximating Language Edit Distance Beyond Fast Matrix Multiplication: Ultralinear Grammars Are Where Parsing Becomes Hard!
- Weak inverse neighborhoods of languages
- Absent Subsequences in Words
- A weak inverse of language neighborhoods and its properties
- The edit distance to k-subsequence universality
- The edit distance to \(k\)-subsequence universality
This page was built for publication: Computing the Shortest String and the Edit-Distance for Parsing Expression Languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5041248)