Context-Limited Grammars

From MaRDI portal

Revision as of 03:25, 6 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:4042666

Jump to:navigation, search

DOI10.1145/321832.321842zbMath0291.68026OpenAlexW2053365840MaRDI QIDQ4042666

Thomas N. Hibbard

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

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (5)

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

This page was built for publication: Context-Limited Grammars

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4042666&oldid=17767396"