Approximate matching between a context-free grammar and a finite-state automaton

Yo Sub Han, Sang Ki Ko, Kai Salomaa

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

5 Scopus citations

Fingerprint

Dive into the research topics of 'Approximate matching between a context-free grammar and a finite-state automaton'. Together they form a unique fingerprint.

Computer Science