Edit Distance for Pushdown Automata

DOI10.1007/978-3-662-47666-6_10zbMath1440.68151OpenAlexW752779946MaRDI QIDQ3449470

Rasmus Ibsen-Jensen, Jan Otop, Krishnendu Chatterjee, Thomas A. Henzinger

Publication date: 4 November 2015

Published in: Automata, Languages, and Programming (Search for Journal in Brave)

Full work available at URL: https://repository.ist.ac.at/334/1/report.pdf

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (7)

Edit Distance for Pushdown Automata ⋮ Absent Subsequences in Words ⋮ Error correction of semantic mathematical expressions based on Bayesian algorithm ⋮ Finite Approximations and Similarity of Languages ⋮ Descriptional Complexity of Error Detection ⋮ Edit distance neighbourhoods of input-driven pushdown automata ⋮ Edit distance neighbourhoods of input-driven pushdown automata

Cites Work

• Unnamed Item
• Unnamed Item
• Bounded repairability of word languages
• How hard is computing the edit distance?
• From Model Checking to Model Measuring
• Quantitative languages
• Edit distance for timed automata
• Edit Distance for Pushdown Automata
• Processing Compressed Texts: A Tractability Border
• Alternation
• A Method for the Correction of Garbled Words Based on the Levenshtein Metric
• Nested Weighted Automata
• Mapping the genome
• A Minimum Distance Error-Correcting Parser for Context-Free Languages
• EDIT-DISTANCE OF WEIGHTED AUTOMATA: GENERAL DEFINITIONS AND ALGORITHMS

This page was built for publication: Edit Distance for Pushdown Automata