Edit-Distance Between Visibly Pushdown Languages

DOI10.1007/978-3-319-51963-0_30zbMath1444.68095OpenAlexW2568410369MaRDI QIDQ2971150

Sang-Ki Ko, Yo-Sub Han

Publication date: 4 April 2017

Published in: SOFSEM 2017: Theory and Practice of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-51963-0_30

zbMATH Keywords

decidabilityedit distancevisibly pushdown languages

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Formal languages and automata (68Q45)

Related Items (4)

Weak inverse neighborhoods of languages ⋮ Finite Approximations and Similarity of Languages ⋮ Input-driven pushdown automata for edit distance neighborhood ⋮ Deciding path size of nondeterministic (and input-driven) pushdown automata

Cites Work

• Distances between languages and reflexivity of relations
• Marrying Words and Trees
• Visibly pushdown languages
• The String-to-String Correction Problem
• Regularity Problems for Visibly Pushdown Languages
• THE EDIT-DISTANCE BETWEEN A REGULAR LANGUAGE AND A CONTEXT-FREE LANGUAGE
• Programming Techniques: Regular expression search algorithm
• EDIT-DISTANCE OF WEIGHTED AUTOMATA: GENERAL DEFINITIONS AND ALGORITHMS
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Edit-Distance Between Visibly Pushdown Languages