Context-Limited Grammars
From MaRDI portal
Publication:4042666
DOI10.1145/321832.321842zbMath0291.68026OpenAlexW2053365840MaRDI QIDQ4042666
Publication date: 1974
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/321832.321842
Related Items
Termination proofs for string rewriting systems via inverse match-bounds, Time-Complexity of the Word Problem for Semigroups and the Higman Embedding Theorem, Match-bounded string rewriting systems, Deleting string rewriting systems preserve regularity, FINDING FINITE AUTOMATA THAT CERTIFY TERMINATION OF STRING REWRITING SYSTEMS
