Descriptional complexity of error detection
From MaRDI portal
Publication:4686648
DOI10.1007/978-3-319-46376-6_6zbMATH Open1396.68068OpenAlexW2547353811MaRDI QIDQ4686648FDOQ4686648
Authors: Timothy Ng, David Rappaport, Kai Salomaa 
Publication date: 4 October 2018
Published in: Emergent Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-46376-6_6
Recommendations
Cites Work
- Distances between languages and reflexivity of relations
- Computing the edit distance of a regular language
- Title not available (Why is that?)
- The edit-distance between a regular language and a context-free language
- Title not available (Why is that?)
- EDIT-DISTANCE OF WEIGHTED AUTOMATA: GENERAL DEFINITIONS AND ALGORITHMS
- Bounded repairability of word languages
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Encyclopedia of Distances
- The limitedness problem on distance automata: Hashiguchi's method revisited
- A Second Course in Formal Languages and Automata Theory
- Quotient Complexity of Ideal Languages
- Formal descriptions of code properties: decidability, complexity, implementation
- Error-correction, and finite-delay decodability
- How hard is computing the edit distance?
- Finite transducers and nondeterministic state complexity of regular languages
- Maximal error-detecting capabilities of formal languages
- Fast string correction with Levenshtein automata
- An algebra of discrete channels that involve combinations of three basic error types
- Additive distances and quasi-distances between words
- Quasi-distances and weighted finite automata
- Computing maximal error-detecting capabilities and distances of regular languages
- State complexity of neighbourhoods and approximate pattern matching
- Parameterized Prefix Distance between Regular Languages
- State complexity of additive weighted finite automata
- The per-character cost of repairing word languages
- Edit distance for pushdown automata
- State complexity of prefix distance
Cited In (8)
- Title not available (Why is that?)
- Edit distance neighbourhoods of input-driven pushdown automata
- Edit distance neighbourhoods of input-driven pushdown automata
- State complexity of suffix distance
- State complexity of neighbourhoods and approximate pattern matching
- Regularity of a dynamic neighborhood of a regular language
- State complexity of neighbourhoods and approximate pattern matching
- Computing maximal error-detecting capabilities and distances of regular languages
This page was built for publication: Descriptional complexity of error detection
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4686648)
