Computing the Shortest String and the Edit-Distance for Parsing Expression Languages (Q5041248): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Parsing algorithms with backtrack / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packrat parsing: / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parsing expression grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Error Detecting and Error Correcting Codes / 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: Context-Freeness of Parsing Expression Languages is Undecidable / 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: Q5528329 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The computational power of parsing expression grammars / 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: State Complexity of Neighbourhoods and Approximate Pattern Matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4531380 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unambiguous Boolean grammars / rank
 
Normal rank

Latest revision as of 09:49, 30 July 2024

scientific article; zbMATH DE number 7601060
Language Label Description Also known as
English
Computing the Shortest String and the Edit-Distance for Parsing Expression Languages
scientific article; zbMATH DE number 7601060

    Statements

    Identifiers