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

From MaRDI portal

(Redirected from Approximate matching between a context-free grammar and a finite-state automaton)

Jump to:navigation, search

WARNING: Page is not linked to a MaRDI-Entity. Please add Sitelink / Wikibase-link.

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Approximate_matching_between_a_context-free_grammar_and_a_finite-state_automaton&oldid=60449007"