Approximate Matching between a Context-Free Grammar and a Finite-State Automaton (Q5327490): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 19:49, 5 March 2024
scientific article; zbMATH DE number 6196399
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximate Matching between a Context-Free Grammar and a Finite-State Automaton |
scientific article; zbMATH DE number 6196399 |
Statements
Approximate Matching between a Context-Free Grammar and a Finite-State Automaton (English)
0 references
7 August 2013
0 references
approximate matching
0 references
edit-distance
0 references
context-free grammars
0 references
finite-state automata
0 references
