Edit distance neighbourhoods of input-driven pushdown automata
From MaRDI portal
Publication:5920061
DOI10.1007/978-3-319-58747-9_23zbMath1489.68133OpenAlexW2611419246MaRDI QIDQ5920061
Alexander Okhotin, Kai Salomaa
Publication date: 22 August 2017
Published in: Computer Science – Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-58747-9_23
Related Items (5)
Finite Approximations and Similarity of Languages ⋮ Further closure properties of input-driven pushdown automata ⋮ State Complexity of the Quotient Operation on Input-Driven Pushdown Automata ⋮ Input-driven pushdown automata for edit distance neighborhood ⋮ Edit distance neighbourhoods of input-driven pushdown automata
Cites Work
- Unnamed Item
- Unnamed Item
- Approximate matching between a context-free grammar and a finite-state automaton
- Descriptional complexity of unambiguous input-driven pushdown automata
- On multiple context-free grammars
- How hard is computing the edit distance?
- Nondeterministic state complexity of nested word automata
- Operational state complexity of nested word automata
- State complexity of operations on input-driven pushdown automata
- Input-driven languages are linear conjunctive
- Input-Driven Pushdown Automata with Limited Nondeterminism
- Tinput-Driven Pushdown Automata
- STATE COMPLEXITY OF ADDITIVE WEIGHTED FINITE AUTOMATA
- Edit Distance for Pushdown Automata
- Generalizations of Code Languages with Marginal Errors
- Adding nesting structure to words
- Visibly pushdown languages
- Synchronization of Pushdown Automata
- Descriptional Complexity of Error Detection
- Recognition of Linear-Slender Context-Free Languages by Real Time One-Way Cellular Automata
- 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 neighbourhoods of input-driven pushdown automata
