Computing the Shortest String and the Edit-Distance for Parsing Expression Languages

DOI10.1007/978-3-030-48516-0_4OpenAlexW3031891396MaRDI QIDQ5041248

Yo-Sub Han, Hyunjoon Cheon

Publication date: 13 October 2022

Published in: Developments in Language Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-48516-0_4

zbMATH Keywords

formal languagesedit-distanceparsing expression grammars

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (2)

Weak inverse neighborhoods of languages ⋮ Absent Subsequences in Words

Cites Work

• Unnamed Item
• Unnamed Item
• Unambiguous Boolean grammars
• Computing the edit distance of a regular language
• Packrat parsing:
• Parsing expression grammars
• Parsing algorithms with backtrack
• Error Detecting and Error Correcting Codes
• State Complexity of Neighbourhoods and Approximate Pattern Matching
• Context-Freeness of Parsing Expression Languages is Undecidable
• THE EDIT-DISTANCE BETWEEN A REGULAR LANGUAGE AND A CONTEXT-FREE LANGUAGE
• EDIT-DISTANCE OF WEIGHTED AUTOMATA: GENERAL DEFINITIONS AND ALGORITHMS
• The computational power of parsing expression grammars

This page was built for publication: Computing the Shortest String and the Edit-Distance for Parsing Expression Languages