Approximate Matching between a Context-Free Grammar and a Finite-State Automaton (Q5327490): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/978-3-642-39274-0_14 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1779305186 / rank | |||
Normal rank | |||
Latest revision as of 19:20, 19 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
