An axiomatic definition of context-free rewriting and its application to NLC graph grammars

Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems

Gérard Huet · Journal of the ACM · 1980 · 1.1K citations · Full text

Language Studies, Information Systems, Computational Linguistics +7

Two Families of Languages Related to ALGOL

Seymour Ginsburg, H. Gordon Rice · Journal of the ACM · 1962 · 288 citations · Full text

Computing, Computer Science, Computational Linguistics +4

Graph expressions and graph rewritings

Michel Bauderon, Bruno Courcelle · Theory of Computing Systems · 1987 · 238 citations

Computing, Computer Science, Formal Methods +11

Algebraic automata and context-free sets

J. E. Mezei, Jesse B. Wright · Information and Control · 1967 · 219 citations

Computing, Computer Science, Mathematics +10

Boundary NLC graph grammars—Basic definitions, normal forms, and complexity

Grzegorz Rozenberg, Emo Welzl · Information and Control · 1986 · 142 citations

Language Studies, Computer Science, Linguistics +16