Descriptional Complexity of Error Detection (Q4686648): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-319-46376-6_6 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2547353811 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded repairability of word languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: The per-character cost of repairing word languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quotient Complexity of Ideal Languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5422230 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edit Distance for Pushdown Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distances between languages and reflexivity of relations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4342497 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Encyclopedia of Distances / rank
 
Normal rank
Property / cites work
 
Property / cites work: FORMAL DESCRIPTIONS OF CODE PROPERTIES: DECIDABILITY, COMPLEXITY, IMPLEMENTATION / rank
 
Normal rank
Property / cites work
 
Property / cites work: THE EDIT-DISTANCE BETWEEN A REGULAR LANGUAGE AND A CONTEXT-FREE LANGUAGE / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5313794 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algebra of discrete channels that involve combinations of three basic error types / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5422240 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the edit distance of a regular language / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5503440 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing Maximal Error-detecting Capabilities and Distances of Regular Languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Prefix Distance between Regular Languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: The limitedness problem on distance automata: Hashiguchi's method revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5528329 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4681771 / rank
 
Normal rank
Property / cites work
 
Property / cites work: EDIT-DISTANCE OF WEIGHTED AUTOMATA: GENERAL DEFINITIONS AND ALGORITHMS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quasi-Distances and Weighted Finite Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: State Complexity of Neighbourhoods and Approximate Pattern Matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: State Complexity of Prefix Distance / rank
 
Normal rank
Property / cites work
 
Property / cites work: How hard is computing the edit distance? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite transducers and nondeterministic state complexity of regular languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: STATE COMPLEXITY OF ADDITIVE WEIGHTED FINITE AUTOMATA / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast string correction with Levenshtein automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Second Course in Formal Languages and Automata Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4230829 / rank
 
Normal rank

Latest revision as of 18:44, 16 July 2024

scientific article; zbMATH DE number 6946909
Language Label Description Also known as
English
Descriptional Complexity of Error Detection
scientific article; zbMATH DE number 6946909

    Statements

    Descriptional Complexity of Error Detection (English)
    0 references
    0 references
    0 references
    0 references
    4 October 2018
    0 references
    0 references
    state complexity
    0 references
    Hausdorff distance
    0 references
    edit distance
    0 references
    regular language
    0 references
    finite automaton
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references