Opening book details…
About this Computer Science article
Approximate Matching Between a Context-free Grammar and a Finite-state Automaton by Ko, Sang-Ki; Han, Yo-Sub; Salomaa, Kai is a Computer Science article available to read on EtoBox.
It is typically read by researchers, students, and practitioners in Computer Science.
- Author
- Ko, Sang-Ki; Han, Yo-Sub; Salomaa, Kai
- Publisher
- Elsevier Science; Elsevier ; Elsevier Inc.; Elsevier BV (ISSN 0890-5401)
- Published
- 2016
- Language
- EN
- Field
- Computer Science (Physical Sciences)