Theoretical Computer Science · 2002 · 25 citations · 4 references
ComputingComputer ScienceNatural Language ProcessingProgramming LanguagesSyntaxContext-free LanguagesLanguage ModelsSyntactic AnalysisContext-sensitive LanguagesPumpingPumping LemmaPumping Lemma For Context-free Languages
4
An Algorithm for the General Petri Net Reachability Problem
Ernst Mayr · SIAM Journal on Computing · 1984 · 457 citations
A. P. J. van der Walt · IFIP Congress · 1971 · 43 citations