Skip to main navigation Skip to search Skip to main content

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

  • Yonsei University
  • Queen's University Kingston

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.
Sort by

Computer Science