Weak inverse neighborhoods of languages
From MaRDI portal
Publication:6067327
DOI10.1007/978-3-031-33264-7_6MaRDI QIDQ6067327
Publication date: 16 November 2023
Published in: Developments in Language Theory (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Bounded repairability of word languages
- Most pseudo-copy languages are not context-free
- The string edit distance matching problem with moves
- Edit-Distance Between Visibly Pushdown Languages
- STATE COMPLEXITY OF ADDITIVE WEIGHTED FINITE AUTOMATA
- Parsing expression grammars
- Error Detecting and Error Correcting Codes
- State Complexity of Neighbourhoods and Approximate Pattern Matching
- Computing the Shortest String and the Edit-Distance for Parsing Expression Languages
- Approximating Edit Distance Within Constant Factor in Truly Sub-quadratic Time
- THE EDIT-DISTANCE BETWEEN A REGULAR LANGUAGE AND A CONTEXT-FREE LANGUAGE
- A Minimum Distance Error-Correcting Parser for Context-Free Languages
- EDIT-DISTANCE OF WEIGHTED AUTOMATA: GENERAL DEFINITIONS AND ALGORITHMS
- Edit distance neighbourhoods of input-driven pushdown automata
This page was built for publication: Weak inverse neighborhoods of languages